Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208600472.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DES-PT-60b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208600472
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 139K May 18 16:42 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 DES-PT-60b-LTLCardinality-00
FORMULA_NAME DES-PT-60b-LTLCardinality-01
FORMULA_NAME DES-PT-60b-LTLCardinality-02
FORMULA_NAME DES-PT-60b-LTLCardinality-03
FORMULA_NAME DES-PT-60b-LTLCardinality-04
FORMULA_NAME DES-PT-60b-LTLCardinality-05
FORMULA_NAME DES-PT-60b-LTLCardinality-06
FORMULA_NAME DES-PT-60b-LTLCardinality-07
FORMULA_NAME DES-PT-60b-LTLCardinality-08
FORMULA_NAME DES-PT-60b-LTLCardinality-09
FORMULA_NAME DES-PT-60b-LTLCardinality-10
FORMULA_NAME DES-PT-60b-LTLCardinality-11
FORMULA_NAME DES-PT-60b-LTLCardinality-12
FORMULA_NAME DES-PT-60b-LTLCardinality-13
FORMULA_NAME DES-PT-60b-LTLCardinality-14
FORMULA_NAME DES-PT-60b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716342450288

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 01:47:31] [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]
[2024-05-22 01:47:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:47:32] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-22 01:47:32] [INFO ] Transformed 519 places.
[2024-05-22 01:47:32] [INFO ] Transformed 470 transitions.
[2024-05-22 01:47:32] [INFO ] Found NUPN structural information;
[2024-05-22 01:47:32] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DES-PT-60b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 492 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 492 transition count 446
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 477 transition count 431
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 477 transition count 431
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 93 place count 477 transition count 419
Applied a total of 93 rules in 116 ms. Remains 477 /519 variables (removed 42) and now considering 419/470 (removed 51) transitions.
// Phase 1: matrix 419 rows 477 cols
[2024-05-22 01:47:32] [INFO ] Computed 62 invariants in 56 ms
[2024-05-22 01:47:32] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-05-22 01:47:32] [INFO ] Invariant cache hit.
[2024-05-22 01:47:33] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 1102 ms to find 0 implicit places.
[2024-05-22 01:47:33] [INFO ] Invariant cache hit.
[2024-05-22 01:47:33] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 477/519 places, 419/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1448 ms. Remains : 477/519 places, 419/470 transitions.
Support contains 16 out of 477 places after structural reductions.
[2024-05-22 01:47:34] [INFO ] Flatten gal took : 68 ms
[2024-05-22 01:47:34] [INFO ] Flatten gal took : 34 ms
[2024-05-22 01:47:34] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 14 out of 477 places (down from 16) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:47:34] [INFO ] Invariant cache hit.
[2024-05-22 01:47:34] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 01:47:34] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 38 ms returned sat
[2024-05-22 01:47:34] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:47:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2024-05-22 01:47:34] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 38 ms returned sat
[2024-05-22 01:47:34] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:47:35] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 6 ms to minimize.
[2024-05-22 01:47:35] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-22 01:47:35] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-22 01:47:35] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 0 ms to minimize.
[2024-05-22 01:47:35] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-22 01:47:35] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-22 01:47:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 654 ms
[2024-05-22 01:47:35] [INFO ] After 933ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-22 01:47:35] [INFO ] After 1095ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 471 transition count 397
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 454 transition count 397
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 454 transition count 384
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 441 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 440 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 440 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 440 transition count 381
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 439 transition count 380
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 221 place count 363 transition count 304
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 227 place count 360 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 360 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 359 transition count 311
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 359 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 358 transition count 310
Applied a total of 231 rules in 177 ms. Remains 358 /477 variables (removed 119) and now considering 310/419 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 358/477 places, 310/419 transitions.
Incomplete random walk after 10000 steps, including 482 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1329882 steps, run timeout after 3001 ms. (steps per millisecond=443 ) properties seen :{}
Probabilistic random walk after 1329882 steps, saw 183148 distinct states, run finished after 3001 ms. (steps per millisecond=443 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 310 rows 358 cols
[2024-05-22 01:47:38] [INFO ] Computed 61 invariants in 11 ms
[2024-05-22 01:47:38] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2024-05-22 01:47:38] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:47:39] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:47:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 9 ms returned sat
[2024-05-22 01:47:39] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 161 ms returned sat
[2024-05-22 01:47:39] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:47:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:47:39] [INFO ] After 31ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:47:39] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 01:47:39] [INFO ] After 688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 310/310 transitions.
Applied a total of 0 rules in 14 ms. Remains 358 /358 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 358/358 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 310/310 transitions.
Applied a total of 0 rules in 12 ms. Remains 358 /358 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2024-05-22 01:47:39] [INFO ] Invariant cache hit.
[2024-05-22 01:47:40] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-22 01:47:40] [INFO ] Invariant cache hit.
[2024-05-22 01:47:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:47:40] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
[2024-05-22 01:47:40] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-22 01:47:40] [INFO ] Invariant cache hit.
[2024-05-22 01:47:40] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1049 ms. Remains : 358/358 places, 310/310 transitions.
Graph (complete) has 1256 edges and 358 vertex of which 357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 357 transition count 310
Applied a total of 2 rules in 23 ms. Remains 357 /358 variables (removed 1) and now considering 310/310 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 310 rows 357 cols
[2024-05-22 01:47:40] [INFO ] Computed 60 invariants in 12 ms
[2024-05-22 01:47:40] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:47:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 01:47:40] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:47:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:47:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 112 ms returned sat
[2024-05-22 01:47:41] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:47:41] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-22 01:47:41] [INFO ] After 438ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA DES-PT-60b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 297 stabilizing places and 289 stable transitions
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.20 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' '!(F(p0))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 470 transition count 400
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 31 place count 455 transition count 387
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 57 place count 442 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 441 transition count 386
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 441 transition count 384
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 440 transition count 383
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 209 place count 367 transition count 310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 215 place count 364 transition count 318
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 362 transition count 316
Applied a total of 217 rules in 80 ms. Remains 362 /477 variables (removed 115) and now considering 316/419 (removed 103) transitions.
// Phase 1: matrix 316 rows 362 cols
[2024-05-22 01:47:41] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 01:47:41] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-22 01:47:41] [INFO ] Invariant cache hit.
[2024-05-22 01:47:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:47:42] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2024-05-22 01:47:42] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-22 01:47:42] [INFO ] Invariant cache hit.
[2024-05-22 01:47:42] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/477 places, 316/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1093 ms. Remains : 362/477 places, 316/419 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 149 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s282 0) (EQ s253 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA DES-PT-60b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-00 finished in 1297 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 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 470 transition count 401
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 456 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 31 place count 455 transition count 387
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 57 place count 442 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 441 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 441 transition count 384
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 63 place count 440 transition count 383
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 215 place count 364 transition count 307
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 221 place count 361 transition count 315
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 359 transition count 313
Applied a total of 223 rules in 73 ms. Remains 359 /477 variables (removed 118) and now considering 313/419 (removed 106) transitions.
// Phase 1: matrix 313 rows 359 cols
[2024-05-22 01:47:42] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 01:47:43] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 01:47:43] [INFO ] Invariant cache hit.
[2024-05-22 01:47:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:47:43] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
[2024-05-22 01:47:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:47:43] [INFO ] Invariant cache hit.
[2024-05-22 01:47:43] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/477 places, 313/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1049 ms. Remains : 359/477 places, 313/419 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-03 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 s316 0) (EQ s50 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 5523 reset in 355 ms.
Product exploration explored 100000 steps with 5504 reset in 289 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 311 steps, including 16 resets, run visited all 1 properties in 3 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 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 313/313 transitions.
Applied a total of 0 rules in 14 ms. Remains 359 /359 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-05-22 01:47:45] [INFO ] Invariant cache hit.
[2024-05-22 01:47:45] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-22 01:47:45] [INFO ] Invariant cache hit.
[2024-05-22 01:47:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:47:45] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2024-05-22 01:47:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:47:45] [INFO ] Invariant cache hit.
[2024-05-22 01:47:46] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1024 ms. Remains : 359/359 places, 313/313 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
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 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5511 reset in 247 ms.
Product exploration explored 100000 steps with 5516 reset in 272 ms.
Built C files in :
/tmp/ltsmin14951856479012753717
[2024-05-22 01:47:47] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2024-05-22 01:47:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:47] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2024-05-22 01:47:47] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:47] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2024-05-22 01:47:47] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:47:47] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14951856479012753717
Running compilation step : cd /tmp/ltsmin14951856479012753717;'/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'
Compilation finished in 833 ms.
Running link step : cd /tmp/ltsmin14951856479012753717;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14951856479012753717;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13057658418578503558.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 313/313 transitions.
Applied a total of 0 rules in 17 ms. Remains 359 /359 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-05-22 01:48:02] [INFO ] Invariant cache hit.
[2024-05-22 01:48:02] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-22 01:48:02] [INFO ] Invariant cache hit.
[2024-05-22 01:48:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:48:03] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-22 01:48:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:48:03] [INFO ] Invariant cache hit.
[2024-05-22 01:48:03] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1026 ms. Remains : 359/359 places, 313/313 transitions.
Built C files in :
/tmp/ltsmin12984364036145445341
[2024-05-22 01:48:03] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2024-05-22 01:48:03] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:48:03] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2024-05-22 01:48:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:48:03] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
[2024-05-22 01:48:03] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:48:03] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12984364036145445341
Running compilation step : cd /tmp/ltsmin12984364036145445341;'/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'
Compilation finished in 664 ms.
Running link step : cd /tmp/ltsmin12984364036145445341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12984364036145445341;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14047670109294177827.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:48:18] [INFO ] Flatten gal took : 41 ms
[2024-05-22 01:48:18] [INFO ] Flatten gal took : 40 ms
[2024-05-22 01:48:18] [INFO ] Time to serialize gal into /tmp/LTL716672242568165801.gal : 7 ms
[2024-05-22 01:48:18] [INFO ] Time to serialize properties into /tmp/LTL12536578668458525325.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/LTL716672242568165801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18173440764673253833.hoa' '-atoms' '/tmp/LTL12536578668458525325.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...318
Loading property file /tmp/LTL12536578668458525325.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18173440764673253833.hoa
Detected timeout of ITS tools.
[2024-05-22 01:48:33] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:48:33] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:48:33] [INFO ] Time to serialize gal into /tmp/LTL13975406656994472640.gal : 3 ms
[2024-05-22 01:48:33] [INFO ] Time to serialize properties into /tmp/LTL15928240722002207491.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/LTL13975406656994472640.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15928240722002207491.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p457==0)||(p56==1))"))))
Formula 0 simplified : FG!"((p457==0)||(p56==1))"
Detected timeout of ITS tools.
[2024-05-22 01:48:48] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:48:48] [INFO ] Applying decomposition
[2024-05-22 01:48:48] [INFO ] Flatten gal took : 26 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/graph11099832896426747977.txt' '-o' '/tmp/graph11099832896426747977.bin' '-w' '/tmp/graph11099832896426747977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11099832896426747977.bin' '-l' '-1' '-v' '-w' '/tmp/graph11099832896426747977.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:48:48] [INFO ] Decomposing Gal with order
[2024-05-22 01:48:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:48:49] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-22 01:48:49] [INFO ] Flatten gal took : 62 ms
[2024-05-22 01:48:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2024-05-22 01:48:49] [INFO ] Time to serialize gal into /tmp/LTL16745641780138310932.gal : 5 ms
[2024-05-22 01:48:49] [INFO ] Time to serialize properties into /tmp/LTL941649320362029761.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/LTL16745641780138310932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL941649320362029761.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("((i5.u29.p457==0)||(u9.p56==1))"))))
Formula 0 simplified : FG!"((i5.u29.p457==0)||(u9.p56==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2047866963012342285
[2024-05-22 01:49:04] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2047866963012342285
Running compilation step : cd /tmp/ltsmin2047866963012342285;'/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'
Compilation finished in 513 ms.
Running link step : cd /tmp/ltsmin2047866963012342285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2047866963012342285;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60b-LTLCardinality-03 finished in 96487 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 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 470 transition count 400
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 31 place count 455 transition count 387
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 57 place count 442 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 441 transition count 386
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 441 transition count 384
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 440 transition count 383
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 213 place count 365 transition count 308
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 219 place count 362 transition count 316
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 360 transition count 314
Applied a total of 221 rules in 73 ms. Remains 360 /477 variables (removed 117) and now considering 314/419 (removed 105) transitions.
// Phase 1: matrix 314 rows 360 cols
[2024-05-22 01:49:19] [INFO ] Computed 59 invariants in 4 ms
[2024-05-22 01:49:19] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-05-22 01:49:19] [INFO ] Invariant cache hit.
[2024-05-22 01:49:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:49:20] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2024-05-22 01:49:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:49:20] [INFO ] Invariant cache hit.
[2024-05-22 01:49:20] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/477 places, 314/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1178 ms. Remains : 360/477 places, 314/419 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-05 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 s318 0) (EQ s105 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 5589 reset in 251 ms.
Product exploration explored 100000 steps with 5611 reset in 265 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 543 steps, including 30 resets, run visited all 1 properties in 8 ms. (steps per millisecond=67 )
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 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 314/314 transitions.
Applied a total of 0 rules in 16 ms. Remains 360 /360 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 01:49:21] [INFO ] Invariant cache hit.
[2024-05-22 01:49:21] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-22 01:49:21] [INFO ] Invariant cache hit.
[2024-05-22 01:49:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:49:22] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1357 ms to find 0 implicit places.
[2024-05-22 01:49:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:49:23] [INFO ] Invariant cache hit.
[2024-05-22 01:49:23] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1570 ms. Remains : 360/360 places, 314/314 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 575 steps, including 30 resets, run visited all 1 properties in 7 ms. (steps per millisecond=82 )
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 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5617 reset in 236 ms.
Product exploration explored 100000 steps with 5587 reset in 247 ms.
Built C files in :
/tmp/ltsmin2958336310627687254
[2024-05-22 01:49:24] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2024-05-22 01:49:24] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:24] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2024-05-22 01:49:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:24] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2024-05-22 01:49:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:24] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2958336310627687254
Running compilation step : cd /tmp/ltsmin2958336310627687254;'/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'
Compilation finished in 680 ms.
Running link step : cd /tmp/ltsmin2958336310627687254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2958336310627687254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased890198816985092652.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 314/314 transitions.
Applied a total of 0 rules in 19 ms. Remains 360 /360 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 01:49:39] [INFO ] Invariant cache hit.
[2024-05-22 01:49:39] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-22 01:49:39] [INFO ] Invariant cache hit.
[2024-05-22 01:49:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:49:40] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 905 ms to find 0 implicit places.
[2024-05-22 01:49:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:49:40] [INFO ] Invariant cache hit.
[2024-05-22 01:49:40] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1077 ms. Remains : 360/360 places, 314/314 transitions.
Built C files in :
/tmp/ltsmin15092271662283588834
[2024-05-22 01:49:40] [INFO ] Computing symmetric may disable matrix : 314 transitions.
[2024-05-22 01:49:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:40] [INFO ] Computing symmetric may enable matrix : 314 transitions.
[2024-05-22 01:49:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:40] [INFO ] Computing Do-Not-Accords matrix : 314 transitions.
[2024-05-22 01:49:40] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:49:40] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15092271662283588834
Running compilation step : cd /tmp/ltsmin15092271662283588834;'/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'
Compilation finished in 694 ms.
Running link step : cd /tmp/ltsmin15092271662283588834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15092271662283588834;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6453785406468262194.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:49:55] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:49:55] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:49:55] [INFO ] Time to serialize gal into /tmp/LTL13174843793678357071.gal : 3 ms
[2024-05-22 01:49:55] [INFO ] Time to serialize properties into /tmp/LTL7931595679757868537.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/LTL13174843793678357071.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9273873512903546866.hoa' '-atoms' '/tmp/LTL7931595679757868537.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...318
Loading property file /tmp/LTL7931595679757868537.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9273873512903546866.hoa
Detected timeout of ITS tools.
[2024-05-22 01:50:10] [INFO ] Flatten gal took : 13 ms
[2024-05-22 01:50:10] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:50:10] [INFO ] Time to serialize gal into /tmp/LTL2252314462689247718.gal : 7 ms
[2024-05-22 01:50:10] [INFO ] Time to serialize properties into /tmp/LTL8189732439025842463.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/LTL2252314462689247718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8189732439025842463.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p458==0)||(p112==1))"))))
Formula 0 simplified : FG!"((p458==0)||(p112==1))"
Detected timeout of ITS tools.
[2024-05-22 01:50:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 01:50:25] [INFO ] Applying decomposition
[2024-05-22 01:50:25] [INFO ] Flatten gal took : 13 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/graph2627282914950004649.txt' '-o' '/tmp/graph2627282914950004649.bin' '-w' '/tmp/graph2627282914950004649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2627282914950004649.bin' '-l' '-1' '-v' '-w' '/tmp/graph2627282914950004649.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:50:25] [INFO ] Decomposing Gal with order
[2024-05-22 01:50:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:50:25] [INFO ] Removed a total of 48 redundant transitions.
[2024-05-22 01:50:25] [INFO ] Flatten gal took : 22 ms
[2024-05-22 01:50:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 4 ms.
[2024-05-22 01:50:25] [INFO ] Time to serialize gal into /tmp/LTL16178261665130183465.gal : 4 ms
[2024-05-22 01:50:25] [INFO ] Time to serialize properties into /tmp/LTL17142082601604305940.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/LTL16178261665130183465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17142082601604305940.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i1.u22.p458==0)||(u40.p112==1))"))))
Formula 0 simplified : FG!"((i4.i1.u22.p458==0)||(u40.p112==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9372987261623566595
[2024-05-22 01:50:41] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9372987261623566595
Running compilation step : cd /tmp/ltsmin9372987261623566595;'/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'
Compilation finished in 535 ms.
Running link step : cd /tmp/ltsmin9372987261623566595;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9372987261623566595;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-60b-LTLCardinality-05 finished in 96858 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(p0)||G((F(p1)&&F(G(p0))))))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 470 transition count 400
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 455 transition count 388
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 443 transition count 388
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 209 place count 366 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 364 transition count 316
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 364 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 219 place count 362 transition count 310
Applied a total of 219 rules in 59 ms. Remains 362 /477 variables (removed 115) and now considering 310/419 (removed 109) transitions.
// Phase 1: matrix 310 rows 362 cols
[2024-05-22 01:50:56] [INFO ] Computed 59 invariants in 6 ms
[2024-05-22 01:50:56] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-22 01:50:56] [INFO ] Invariant cache hit.
[2024-05-22 01:50:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:50:57] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
[2024-05-22 01:50:57] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:50:57] [INFO ] Invariant cache hit.
[2024-05-22 01:50:57] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/477 places, 310/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1112 ms. Remains : 362/477 places, 310/419 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s253 0) (EQ s247 1)), p1:(AND (EQ s247 0) (EQ s253 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-08 finished in 1311 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(G(p0)))'
Support contains 1 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 474 transition count 416
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 473 transition count 413
Applied a total of 10 rules in 54 ms. Remains 473 /477 variables (removed 4) and now considering 413/419 (removed 6) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-05-22 01:50:57] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 01:50:57] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 01:50:57] [INFO ] Invariant cache hit.
[2024-05-22 01:50:58] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2024-05-22 01:50:58] [INFO ] Invariant cache hit.
[2024-05-22 01:50:58] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/477 places, 413/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1121 ms. Remains : 473/477 places, 413/419 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-10 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:(EQ s267 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-10 finished in 1222 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 U (G(p2)||G(p0)||p1)))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 470 transition count 401
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 456 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 455 transition count 389
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 444 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 443 transition count 388
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 443 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 443 transition count 386
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 59 place count 442 transition count 385
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 211 place count 366 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 217 place count 363 transition count 317
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 361 transition count 315
Applied a total of 219 rules in 103 ms. Remains 361 /477 variables (removed 116) and now considering 315/419 (removed 104) transitions.
// Phase 1: matrix 315 rows 361 cols
[2024-05-22 01:50:58] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 01:50:58] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 01:50:58] [INFO ] Invariant cache hit.
[2024-05-22 01:50:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:50:59] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
[2024-05-22 01:50:59] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:50:59] [INFO ] Invariant cache hit.
[2024-05-22 01:50:59] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 361/477 places, 315/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1015 ms. Remains : 361/477 places, 315/419 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-60b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s257 0) (EQ s270 1)), p2:(OR (EQ s257 0) (EQ s270 1)), p0:(EQ s142 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5922 reset in 296 ms.
Product exploration explored 100000 steps with 5938 reset in 293 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Detected a total of 256/361 stabilizing places and 257/315 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 142 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 523 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 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 107 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-22 01:51:00] [INFO ] Invariant cache hit.
[2024-05-22 01:51:00] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-22 01:51:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 01:51:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 01:51:01] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-22 01:51:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:51:01] [INFO ] After 40ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-22 01:51:01] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 01:51:01] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 315/315 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 313
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 313
Applied a total of 4 rules in 28 ms. Remains 360 /361 variables (removed 1) and now considering 313/315 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 360/361 places, 313/315 transitions.
Incomplete random walk after 10000 steps, including 509 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1469261 steps, run timeout after 3001 ms. (steps per millisecond=489 ) properties seen :{}
Probabilistic random walk after 1469261 steps, saw 205540 distinct states, run finished after 3001 ms. (steps per millisecond=489 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 360 cols
[2024-05-22 01:51:04] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:51:04] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:51:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:51:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2024-05-22 01:51:04] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:51:04] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:04] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 01:51:04] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 360/360 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-05-22 01:51:04] [INFO ] Invariant cache hit.
[2024-05-22 01:51:04] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 01:51:04] [INFO ] Invariant cache hit.
[2024-05-22 01:51:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:51:05] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-05-22 01:51:05] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:51:05] [INFO ] Invariant cache hit.
[2024-05-22 01:51:05] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 942 ms. Remains : 360/360 places, 313/313 transitions.
Graph (complete) has 1256 edges and 360 vertex of which 359 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 359 transition count 313
Applied a total of 2 rules in 17 ms. Remains 359 /360 variables (removed 1) and now considering 313/313 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 359 cols
[2024-05-22 01:51:05] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 01:51:05] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:51:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:51:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 01:51:06] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:06] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-22 01:51:06] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 327 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 315/315 transitions.
Applied a total of 0 rules in 11 ms. Remains 361 /361 variables (removed 0) and now considering 315/315 (removed 0) transitions.
// Phase 1: matrix 315 rows 361 cols
[2024-05-22 01:51:06] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 01:51:06] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 01:51:06] [INFO ] Invariant cache hit.
[2024-05-22 01:51:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:51:07] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2024-05-22 01:51:07] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:51:07] [INFO ] Invariant cache hit.
[2024-05-22 01:51:07] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 977 ms. Remains : 361/361 places, 315/315 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Detected a total of 256/361 stabilizing places and 257/315 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 95 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 517 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:51:07] [INFO ] Invariant cache hit.
[2024-05-22 01:51:07] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:51:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-22 01:51:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2024-05-22 01:51:08] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:51:08] [INFO ] After 38ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:08] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-22 01:51:08] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 315/315 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 313
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 313
Applied a total of 4 rules in 24 ms. Remains 360 /361 variables (removed 1) and now considering 313/315 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 360/361 places, 313/315 transitions.
Incomplete random walk after 10000 steps, including 507 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1343790 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1343790 steps, saw 187381 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 360 cols
[2024-05-22 01:51:11] [INFO ] Computed 60 invariants in 11 ms
[2024-05-22 01:51:11] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:51:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:51:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 27 ms returned sat
[2024-05-22 01:51:11] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:51:11] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:11] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 01:51:11] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 360/360 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-05-22 01:51:11] [INFO ] Invariant cache hit.
[2024-05-22 01:51:11] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 01:51:11] [INFO ] Invariant cache hit.
[2024-05-22 01:51:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 01:51:12] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2024-05-22 01:51:12] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:51:12] [INFO ] Invariant cache hit.
[2024-05-22 01:51:12] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 900 ms. Remains : 360/360 places, 313/313 transitions.
Graph (complete) has 1256 edges and 360 vertex of which 359 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 359 transition count 313
Applied a total of 2 rules in 16 ms. Remains 359 /360 variables (removed 1) and now considering 313/313 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 313 rows 359 cols
[2024-05-22 01:51:12] [INFO ] Computed 59 invariants in 5 ms
[2024-05-22 01:51:12] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:51:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:51:12] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 01:51:13] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:51:13] [INFO ] After 208ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-22 01:51:13] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 173 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6016 reset in 266 ms.
Product exploration explored 100000 steps with 5949 reset in 274 ms.
Built C files in :
/tmp/ltsmin7186415960604203196
[2024-05-22 01:51:14] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2024-05-22 01:51:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:14] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2024-05-22 01:51:14] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:14] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2024-05-22 01:51:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:14] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7186415960604203196
Running compilation step : cd /tmp/ltsmin7186415960604203196;'/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'
Compilation finished in 745 ms.
Running link step : cd /tmp/ltsmin7186415960604203196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7186415960604203196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6059506353803586982.hoa' '--buchi-type=spotba'
LTSmin run took 2104 ms.
FORMULA DES-PT-60b-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLCardinality-13 finished in 18313 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)))'
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)))'
[2024-05-22 01:51:17] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9815322737956613412
[2024-05-22 01:51:17] [INFO ] Applying decomposition
[2024-05-22 01:51:17] [INFO ] Computing symmetric may disable matrix : 419 transitions.
[2024-05-22 01:51:17] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:17] [INFO ] Computing symmetric may enable matrix : 419 transitions.
[2024-05-22 01:51:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:17] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:51:17] [INFO ] Computing Do-Not-Accords matrix : 419 transitions.
[2024-05-22 01:51:17] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:51:17] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9815322737956613412
Running compilation step : cd /tmp/ltsmin9815322737956613412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
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/graph1057337738476403799.txt' '-o' '/tmp/graph1057337738476403799.bin' '-w' '/tmp/graph1057337738476403799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1057337738476403799.bin' '-l' '-1' '-v' '-w' '/tmp/graph1057337738476403799.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:51:17] [INFO ] Decomposing Gal with order
[2024-05-22 01:51:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:51:17] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 01:51:17] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:51:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 01:51:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality8458215724230510591.gal : 5 ms
[2024-05-22 01:51:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality17138882405304974863.ltl : 113 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/LTLCardinality8458215724230510591.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17138882405304974863.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...277
Read 2 LTL properties
Checking formula 0 : !((G(F("((i9.i1.u64.p457==0)||(u35.p56==1))"))))
Formula 0 simplified : FG!"((i9.i1.u64.p457==0)||(u35.p56==1))"
Compilation finished in 942 ms.
Running link step : cd /tmp/ltsmin9815322737956613412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin9815322737956613412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t117, t312, t380, t381, t413, u8.t257, u8.t258, u8.t259, u8.t260, u8.t261, u8.t262, ...1287
Computing Next relation with stutter on 3.85242e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-22 02:12:32] [INFO ] Applying decomposition
[2024-05-22 02:12:32] [INFO ] Flatten gal took : 45 ms
[2024-05-22 02:12:32] [INFO ] Decomposing Gal with order
[2024-05-22 02:12:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:12:32] [INFO ] Removed a total of 244 redundant transitions.
[2024-05-22 02:12:32] [INFO ] Flatten gal took : 91 ms
[2024-05-22 02:12:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 804 labels/synchronizations in 68 ms.
[2024-05-22 02:12:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality13952325086002495672.gal : 11 ms
[2024-05-22 02:12:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality11032974916660920906.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/LTLCardinality13952325086002495672.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11032974916660920906.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 2 LTL properties
Checking formula 0 : !((G(F("((i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.i0.i0.i0.i0.i0.u88.p457==0)||(i0.i0.i0.u4.p56==1))"))))
Formula 0 simplified : FG!"((i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.i0.i0.i0.i0.i0.u88.p457==0)||(i0.i0.i0.u4.p56==1))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin9815322737956613412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9815322737956613412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-22 02:33:49] [INFO ] Flatten gal took : 32 ms
[2024-05-22 02:33:49] [INFO ] Input system was already deterministic with 419 transitions.
[2024-05-22 02:33:49] [INFO ] Transformed 477 places.
[2024-05-22 02:33:49] [INFO ] Transformed 419 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 02:33:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality5022204270279603679.gal : 3 ms
[2024-05-22 02:33:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality3969728503161075006.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/LTLCardinality5022204270279603679.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3969728503161075006.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("((p457==0)||(p56==1))"))))
Formula 0 simplified : FG!"((p457==0)||(p56==1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10530512 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16040036 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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="DES-PT-60b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-60b, 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 r109-tall-171624208600472"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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