Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414400087.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BridgeAndVehicles-COL-V80P50N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414400087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.8K Apr 13 01:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 00:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 13 00:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 13 01:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 45K 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 BridgeAndVehicles-COL-V80P50N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V80P50N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716627116848

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=BridgeAndVehicles-COL-V80P50N10
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-25 08:51:58] [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-25 08:51:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 08:51:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 08:51:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 08:51:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 712 ms
[2024-05-25 08:51:59] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 188 PT places and 289218.0 transition bindings in 43 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 08:51:59] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 7 ms.
[2024-05-25 08:51:59] [INFO ] Skeletonized 16 HLPN properties in 19 ms.
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Remains 11 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10 rows 12 cols
[2024-05-25 08:52:00] [INFO ] Computed 4 invariants in 16 ms
[2024-05-25 08:52:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-05-25 08:52:01] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2024-05-25 08:52:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2024-05-25 08:52:01] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-25 08:52:01] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-25 08:52:01] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Finished Parikh walk after 260 steps, including 0 resets, run visited all 4 properties in 13 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 14 ms.
Support contains 2 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 10/10 transitions.
Graph (complete) has 20 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 7 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 7 transition count 7
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 6 transition count 6
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 6 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 6 transition count 5
Applied a total of 10 rules in 21 ms. Remains 6 /12 variables (removed 6) and now considering 5/10 (removed 5) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-25 08:52:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 08:52:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 6/12 places, 5/10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Finished Best-First random walk after 347 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=86 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-25 08:52:01] [INFO ] Flatten gal took : 19 ms
[2024-05-25 08:52:01] [INFO ] Flatten gal took : 4 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-25 08:52:01] [INFO ] Unfolded HLPN to a Petri net with 188 places and 2108 transitions 15950 arcs in 185 ms.
[2024-05-25 08:52:01] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 13 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 89 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:52:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-25 08:52:02] [INFO ] Computed 7 invariants in 40 ms
[2024-05-25 08:52:04] [INFO ] Dead Transitions using invariants and state equation in 2196 ms found 0 transitions.
[2024-05-25 08:52:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:04] [INFO ] Invariant cache hit.
[2024-05-25 08:52:04] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-25 08:52:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:04] [INFO ] Invariant cache hit.
[2024-05-25 08:52:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:06] [INFO ] Implicit Places using invariants and state equation in 1191 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2024-05-25 08:52:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:06] [INFO ] Invariant cache hit.
[2024-05-25 08:52:06] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4886 ms. Remains : 188/188 places, 2108/2108 transitions.
Support contains 13 out of 188 places after structural reductions.
[2024-05-25 08:52:07] [INFO ] Flatten gal took : 363 ms
[2024-05-25 08:52:07] [INFO ] Flatten gal took : 161 ms
[2024-05-25 08:52:07] [INFO ] Input system was already deterministic with 2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 341 ms. (steps per millisecond=29 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10007 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10009 steps, including 5 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-25 08:52:08] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:08] [INFO ] Invariant cache hit.
[2024-05-25 08:52:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 08:52:09] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2024-05-25 08:52:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 08:52:09] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-25 08:52:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:10] [INFO ] After 767ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2024-05-25 08:52:11] [INFO ] After 1705ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 1165 ms.
[2024-05-25 08:52:12] [INFO ] After 3573ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 119 ms.
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 397 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:52:13] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-25 08:52:13] [INFO ] Computed 5 invariants in 14 ms
[2024-05-25 08:52:13] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1240 ms. Remains : 186/188 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 118615 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 118615 steps, saw 33853 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 08:52:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:17] [INFO ] Invariant cache hit.
[2024-05-25 08:52:17] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:52:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:52:18] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 08:52:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:19] [INFO ] After 889ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 08:52:19] [INFO ] After 1541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1003 ms.
[2024-05-25 08:52:20] [INFO ] After 3022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 58 ms.
Support contains 4 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 273 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 336 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:52:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:21] [INFO ] Invariant cache hit.
[2024-05-25 08:52:21] [INFO ] Implicit Places using invariants in 400 ms returned []
[2024-05-25 08:52:21] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:21] [INFO ] Invariant cache hit.
[2024-05-25 08:52:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:24] [INFO ] Implicit Places using invariants and state equation in 2785 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3199 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 185/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 251 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3788 ms. Remains : 185/186 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10002 steps, including 5 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 244530 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244530 steps, saw 67540 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 08:52:28] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 185 cols
[2024-05-25 08:52:28] [INFO ] Computed 5 invariants in 10 ms
[2024-05-25 08:52:28] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:52:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:52:29] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 08:52:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:29] [INFO ] After 555ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 08:52:30] [INFO ] After 1688ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 896 ms.
[2024-05-25 08:52:31] [INFO ] After 3052ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 93 ms.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 292 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 185/185 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 250 ms. Remains 185 /185 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:52:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:32] [INFO ] Invariant cache hit.
[2024-05-25 08:52:32] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-25 08:52:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:32] [INFO ] Invariant cache hit.
[2024-05-25 08:52:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:33] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1504 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 184/185 places, 2108/2108 transitions.
Applied a total of 0 rules in 218 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1973 ms. Remains : 184/185 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 251162 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251162 steps, saw 69256 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-25 08:52:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 184 cols
[2024-05-25 08:52:37] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 08:52:37] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:52:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:52:38] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 08:52:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:38] [INFO ] After 580ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 08:52:39] [INFO ] After 1218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 602 ms.
[2024-05-25 08:52:39] [INFO ] After 2143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 65 ms.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 233 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 184/184 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 2108/2108 transitions.
Applied a total of 0 rules in 206 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:52:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:40] [INFO ] Invariant cache hit.
[2024-05-25 08:52:40] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-25 08:52:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:40] [INFO ] Invariant cache hit.
[2024-05-25 08:52:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:42] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1811 ms to find 0 implicit places.
[2024-05-25 08:52:42] [INFO ] Redundant transitions in 135 ms returned []
[2024-05-25 08:52:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:42] [INFO ] Invariant cache hit.
[2024-05-25 08:52:43] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3163 ms. Remains : 184/184 places, 2108/2108 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 184 transition count 370
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 1742 place count 182 transition count 368
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 1744 place count 182 transition count 366
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1746 place count 180 transition count 366
Applied a total of 1746 rules in 21 ms. Remains 180 /184 variables (removed 4) and now considering 366/2108 (removed 1742) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 366 rows 180 cols
[2024-05-25 08:52:43] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 08:52:43] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 08:52:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:52:43] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-25 08:52:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 08:52:44] [INFO ] After 200ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-25 08:52:44] [INFO ] After 449ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 185 ms.
[2024-05-25 08:52:44] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 171 stabilizing places and 324 stable transitions
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 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(G(((p0 U p1)&&(p1||X(p0))))))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 186 transition count 2107
Applied a total of 3 rules in 928 ms. Remains 186 /188 variables (removed 2) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 08:52:45] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-05-25 08:52:45] [INFO ] Computed 6 invariants in 9 ms
[2024-05-25 08:52:46] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
[2024-05-25 08:52:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:52:46] [INFO ] Invariant cache hit.
[2024-05-25 08:52:47] [INFO ] Implicit Places using invariants in 609 ms returned []
[2024-05-25 08:52:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:52:47] [INFO ] Invariant cache hit.
[2024-05-25 08:52:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:50] [INFO ] Implicit Places using invariants and state equation in 2785 ms returned [167]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3407 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 279 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5475 ms. Remains : 185/188 places, 2107/2108 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 469 ms :[(NOT p1), (NOT p1), false]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}]], initial=0, aps=[p1:(LEQ 3 s84), p0:(LEQ 1 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1156 steps with 1 reset in 91 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-01 finished in 6123 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(G(p0)))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 183 transition count 2106
Applied a total of 6 rules in 694 ms. Remains 183 /188 variables (removed 5) and now considering 2106/2108 (removed 2) transitions.
[2024-05-25 08:52:51] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
// Phase 1: matrix 368 rows 183 cols
[2024-05-25 08:52:51] [INFO ] Computed 4 invariants in 8 ms
[2024-05-25 08:52:52] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-25 08:52:52] [INFO ] Flow matrix only has 368 transitions (discarded 1738 similar events)
[2024-05-25 08:52:52] [INFO ] Invariant cache hit.
[2024-05-25 08:52:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:52:54] [INFO ] Implicit Places using invariants and state equation in 2181 ms returned [164]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2694 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 182/188 places, 2106/2108 transitions.
Applied a total of 0 rules in 230 ms. Remains 182 /182 variables (removed 0) and now considering 2106/2106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3620 ms. Remains : 182/188 places, 2106/2108 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 3 (ADD s180 s181)) (LEQ 3 s82))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 513 steps with 0 reset in 24 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-02 finished in 3749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 22 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:52:54] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-25 08:52:54] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 08:52:55] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2024-05-25 08:52:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:55] [INFO ] Invariant cache hit.
[2024-05-25 08:52:55] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-25 08:52:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:52:55] [INFO ] Invariant cache hit.
[2024-05-25 08:52:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:53:00] [INFO ] Implicit Places using invariants and state equation in 4668 ms returned [83, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5007 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 31 ms. Remains 184 /184 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5814 ms. Remains : 184/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s165), p1:(AND (GT 3 (ADD s182 s183)) (GT 3 s165))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 952 ms.
Product exploration explored 100000 steps with 33333 reset in 819 ms.
Computed a total of 167 stabilizing places and 324 stable transitions
Computed a total of 167 stabilizing places and 324 stable transitions
Detected a total of 167/184 stabilizing places and 324/2108 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 p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 26 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-05 finished in 7860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G(p1))))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 2108
Applied a total of 1 rules in 17 ms. Remains 187 /188 variables (removed 1) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:53:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 187 cols
[2024-05-25 08:53:02] [INFO ] Computed 6 invariants in 5 ms
[2024-05-25 08:53:03] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
[2024-05-25 08:53:03] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:03] [INFO ] Invariant cache hit.
[2024-05-25 08:53:04] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-25 08:53:04] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:04] [INFO ] Invariant cache hit.
[2024-05-25 08:53:04] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:53:05] [INFO ] Implicit Places using invariants and state equation in 1595 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2089 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 22 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3083 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 1 s82), p0:(LEQ 3 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 9 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-07 finished in 3314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(G(p1)&&(p2 U (p3||G(p2))))))))'
Support contains 9 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 49 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:53:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-25 08:53:05] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 08:53:06] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
[2024-05-25 08:53:06] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:06] [INFO ] Invariant cache hit.
[2024-05-25 08:53:07] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-25 08:53:07] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:07] [INFO ] Invariant cache hit.
[2024-05-25 08:53:07] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:53:08] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2024-05-25 08:53:08] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:08] [INFO ] Invariant cache hit.
[2024-05-25 08:53:09] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3514 ms. Remains : 186/188 places, 2108/2108 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 p1 p3) (AND p0 p1 p2)), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 2} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=1 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 2} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LEQ s84 s0), p1:(LEQ 2 s82), p3:(AND (GT (ADD s184 s185) (ADD s169 s170)) (GT s83 s167)), p2:(GT s83 s167)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 159 reset in 1153 ms.
Product exploration explored 100000 steps with 159 reset in 1046 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p3) p2)), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (OR (AND p0 p1 p3) (AND p0 p1 p2))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 3822 ms. Reduced automaton from 4 states, 15 edges and 4 AP (stutter sensitive) to 10 states, 35 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 705 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-25 08:53:18] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:18] [INFO ] Invariant cache hit.
[2024-05-25 08:53:18] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2024-05-25 08:53:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:53:19] [INFO ] After 1108ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-25 08:53:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:53:21] [INFO ] After 1543ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2024-05-25 08:53:22] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 1 ms to minimize.
[2024-05-25 08:53:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2024-05-25 08:53:23] [INFO ] After 3584ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 1451 ms.
[2024-05-25 08:53:24] [INFO ] After 6278ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 203 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:53:25] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:25] [INFO ] Invariant cache hit.
[2024-05-25 08:53:26] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1041 ms. Remains : 186/186 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 160902 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160902 steps, saw 45120 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-25 08:53:30] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:30] [INFO ] Invariant cache hit.
[2024-05-25 08:53:30] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:53:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:53:31] [INFO ] After 1192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:53:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:53:33] [INFO ] After 1426ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 08:53:34] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 1 ms to minimize.
[2024-05-25 08:53:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2024-05-25 08:53:35] [INFO ] After 3677ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1554 ms.
[2024-05-25 08:53:37] [INFO ] After 6535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 261 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 206 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 209 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:53:37] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:37] [INFO ] Invariant cache hit.
[2024-05-25 08:53:38] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-25 08:53:38] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:38] [INFO ] Invariant cache hit.
[2024-05-25 08:53:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:53:39] [INFO ] Implicit Places using invariants and state equation in 1665 ms returned []
Implicit Place search using SMT with State Equation took 2055 ms to find 0 implicit places.
[2024-05-25 08:53:39] [INFO ] Redundant transitions in 133 ms returned []
[2024-05-25 08:53:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:39] [INFO ] Invariant cache hit.
[2024-05-25 08:53:40] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3273 ms. Remains : 186/186 places, 2108/2108 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 186 transition count 370
Applied a total of 1738 rules in 8 ms. Remains 186 /186 variables (removed 0) and now considering 370/2108 (removed 1738) transitions.
Running SMT prover for 8 properties.
[2024-05-25 08:53:40] [INFO ] Invariant cache hit.
[2024-05-25 08:53:40] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:53:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:53:42] [INFO ] After 1767ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:53:44] [INFO ] After 3291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1843 ms.
[2024-05-25 08:53:46] [INFO ] After 5226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2) p3))), (G (NOT (AND (NOT p0) p1 (NOT p2) p3)))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p3) p2)), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (OR (AND p0 p1 p3) (AND p0 p1 p2))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (F (NOT (AND p0 p1))), (F (AND p1 p2 (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (OR (AND p1 p2) (AND p1 p3))), (F (AND p0 (NOT p1))), (F (AND p0 p2 (NOT p3))), (F (AND p0 p1 p2 p3)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (F (OR (AND p0 p1 p2) (AND p0 p1 p3))), (F (NOT (AND p0 (NOT p2) (NOT p3))))]
Knowledge based reduction with 18 factoid took 5530 ms. Reduced automaton from 10 states, 35 edges and 4 AP (stutter insensitive) to 8 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 621 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Stuttering acceptance computed with spot in 589 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 274 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:53:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:53] [INFO ] Invariant cache hit.
[2024-05-25 08:53:54] [INFO ] Dead Transitions using invariants and state equation in 826 ms found 0 transitions.
[2024-05-25 08:53:54] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:54] [INFO ] Invariant cache hit.
[2024-05-25 08:53:54] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-25 08:53:54] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:54] [INFO ] Invariant cache hit.
[2024-05-25 08:53:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:53:56] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2251 ms to find 0 implicit places.
[2024-05-25 08:53:56] [INFO ] Redundant transitions in 50 ms returned []
[2024-05-25 08:53:56] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:53:56] [INFO ] Invariant cache hit.
[2024-05-25 08:53:57] [INFO ] Dead Transitions using invariants and state equation in 765 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4191 ms. Remains : 186/186 places, 2108/2108 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND p0 p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 p2 (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
Knowledge based reduction with 26 factoid took 6447 ms. Reduced automaton from 8 states, 29 edges and 4 AP (stutter insensitive) to 8 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 488 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10005 steps, including 5 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 08:54:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:05] [INFO ] Invariant cache hit.
[2024-05-25 08:54:05] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:54:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:54:06] [INFO ] After 1097ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:54:06] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:54:08] [INFO ] After 1284ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 08:54:09] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 1 ms to minimize.
[2024-05-25 08:54:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2024-05-25 08:54:10] [INFO ] After 3252ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1624 ms.
[2024-05-25 08:54:11] [INFO ] After 6102ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 148 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 229 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:54:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:12] [INFO ] Invariant cache hit.
[2024-05-25 08:54:13] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1295 ms. Remains : 186/186 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10004 steps, including 5 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 154349 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154349 steps, saw 43416 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-25 08:54:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:17] [INFO ] Invariant cache hit.
[2024-05-25 08:54:17] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:54:17] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:54:18] [INFO ] After 1121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:54:18] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:54:20] [INFO ] After 1137ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 08:54:21] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2024-05-25 08:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 332 ms
[2024-05-25 08:54:21] [INFO ] After 2759ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1755 ms.
[2024-05-25 08:54:23] [INFO ] After 5796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 214 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 186 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 199 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:54:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:24] [INFO ] Invariant cache hit.
[2024-05-25 08:54:24] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-25 08:54:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:24] [INFO ] Invariant cache hit.
[2024-05-25 08:54:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:54:26] [INFO ] Implicit Places using invariants and state equation in 2205 ms returned []
Implicit Place search using SMT with State Equation took 2589 ms to find 0 implicit places.
[2024-05-25 08:54:26] [INFO ] Redundant transitions in 80 ms returned []
[2024-05-25 08:54:26] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:26] [INFO ] Invariant cache hit.
[2024-05-25 08:54:27] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3657 ms. Remains : 186/186 places, 2108/2108 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 186 transition count 370
Applied a total of 1738 rules in 11 ms. Remains 186 /186 variables (removed 0) and now considering 370/2108 (removed 1738) transitions.
Running SMT prover for 8 properties.
[2024-05-25 08:54:27] [INFO ] Invariant cache hit.
[2024-05-25 08:54:27] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:54:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:54:28] [INFO ] After 951ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:54:29] [INFO ] After 2000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 747 ms.
[2024-05-25 08:54:30] [INFO ] After 2844ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND p0 p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 p2 (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (F (AND p1 p2 (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (AND p1 p2)), (F (AND p0 (NOT p1))), (F (AND p0 p2 (NOT p3))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND p0 p1 p2 p3)), (F (AND p0 p1 p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (NOT p2) (NOT p3))))]
Knowledge based reduction with 26 factoid took 9732 ms. Reduced automaton from 8 states, 29 edges and 4 AP (stutter insensitive) to 8 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 595 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Stuttering acceptance computed with spot in 566 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Stuttering acceptance computed with spot in 651 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Product exploration explored 100000 steps with 157 reset in 1057 ms.
Product exploration explored 100000 steps with 159 reset in 730 ms.
Built C files in :
/tmp/ltsmin4352342518144896873
[2024-05-25 08:54:43] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:54:43] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4352342518144896873
Running compilation step : cd /tmp/ltsmin4352342518144896873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4352342518144896873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4352342518144896873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 270 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:54:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:47] [INFO ] Invariant cache hit.
[2024-05-25 08:54:48] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
[2024-05-25 08:54:48] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:48] [INFO ] Invariant cache hit.
[2024-05-25 08:54:48] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-25 08:54:48] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:48] [INFO ] Invariant cache hit.
[2024-05-25 08:54:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:54:51] [INFO ] Implicit Places using invariants and state equation in 3269 ms returned []
Implicit Place search using SMT with State Equation took 3530 ms to find 0 implicit places.
[2024-05-25 08:54:51] [INFO ] Redundant transitions in 84 ms returned []
[2024-05-25 08:54:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:54:51] [INFO ] Invariant cache hit.
[2024-05-25 08:54:52] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5557 ms. Remains : 186/186 places, 2108/2108 transitions.
Built C files in :
/tmp/ltsmin2617974484578338037
[2024-05-25 08:54:52] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:54:52] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2617974484578338037
Running compilation step : cd /tmp/ltsmin2617974484578338037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2617974484578338037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2617974484578338037;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:54:56] [INFO ] Flatten gal took : 117 ms
[2024-05-25 08:54:56] [INFO ] Flatten gal took : 97 ms
[2024-05-25 08:54:56] [INFO ] Time to serialize gal into /tmp/LTL329709070534317289.gal : 24 ms
[2024-05-25 08:54:56] [INFO ] Time to serialize properties into /tmp/LTL8646203810500825917.prop : 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/LTL329709070534317289.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17668536818241325334.hoa' '-atoms' '/tmp/LTL8646203810500825917.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...317
Loading property file /tmp/LTL8646203810500825917.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17668536818241325334.hoa
Detected timeout of ITS tools.
[2024-05-25 08:55:11] [INFO ] Flatten gal took : 91 ms
[2024-05-25 08:55:11] [INFO ] Flatten gal took : 102 ms
[2024-05-25 08:55:11] [INFO ] Time to serialize gal into /tmp/LTL17653985875145698130.gal : 23 ms
[2024-05-25 08:55:11] [INFO ] Time to serialize properties into /tmp/LTL18325481871896272483.ltl : 6 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/LTL17653985875145698130.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18325481871896272483.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 : !((X(F((G("(SUR_PONT_A_0<=CAPACITE_0)"))||((G("(ROUTE_A_0>=2)"))&&(("(ATTENTE_A_0>ATTENTE_B_0)")U(("(((VIDANGE_0+VIDANGE_1)>(CONTROLEU...244
Formula 0 simplified : XG(F!"(SUR_PONT_A_0<=CAPACITE_0)" & (F!"(ROUTE_A_0>=2)" | (!"(ATTENTE_A_0>ATTENTE_B_0)" M !"(((VIDANGE_0+VIDANGE_1)>(CONTROLEUR_0+CO...199
Detected timeout of ITS tools.
[2024-05-25 08:55:26] [INFO ] Flatten gal took : 109 ms
[2024-05-25 08:55:26] [INFO ] Applying decomposition
[2024-05-25 08:55:26] [INFO ] Flatten gal took : 93 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/graph11706286009199729965.txt' '-o' '/tmp/graph11706286009199729965.bin' '-w' '/tmp/graph11706286009199729965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11706286009199729965.bin' '-l' '-1' '-v' '-w' '/tmp/graph11706286009199729965.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:55:27] [INFO ] Decomposing Gal with order
[2024-05-25 08:55:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:55:30] [INFO ] Removed a total of 2411 redundant transitions.
[2024-05-25 08:55:30] [INFO ] Flatten gal took : 3164 ms
[2024-05-25 08:55:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 2102 labels/synchronizations in 152 ms.
[2024-05-25 08:55:31] [INFO ] Time to serialize gal into /tmp/LTL13588287157873366684.gal : 17 ms
[2024-05-25 08:55:31] [INFO ] Time to serialize properties into /tmp/LTL11121265796631727070.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/LTL13588287157873366684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11121265796631727070.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 : !((X(F((G("(gu1.SUR_PONT_A_0<=gu1.CAPACITE_0)"))||((G("(gu3.ROUTE_A_0>=2)"))&&(("(gu0.ATTENTE_A_0>gu0.ATTENTE_B_0)")U(("(((gu2.VIDANGE...296
Formula 0 simplified : XG(F!"(gu1.SUR_PONT_A_0<=gu1.CAPACITE_0)" & (F!"(gu3.ROUTE_A_0>=2)" | (!"(gu0.ATTENTE_A_0>gu0.ATTENTE_B_0)" M !"(((gu2.VIDANGE_0+gu2...243
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12818066423703794565
[2024-05-25 08:55:46] [INFO ] Built C files in 58ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12818066423703794565
Running compilation step : cd /tmp/ltsmin12818066423703794565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12818066423703794565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12818066423703794565;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-08 finished in 163351 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(X(G(p0))))'
Support contains 2 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 185 transition count 2107
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 185 transition count 2107
Applied a total of 4 rules in 27 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 08:55:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-25 08:55:49] [INFO ] Computed 5 invariants in 6 ms
[2024-05-25 08:55:50] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
[2024-05-25 08:55:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:55:50] [INFO ] Invariant cache hit.
[2024-05-25 08:55:50] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-25 08:55:50] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:55:50] [INFO ] Invariant cache hit.
[2024-05-25 08:55:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:55:51] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1814 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 22 ms. Remains 184 /184 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2643 ms. Remains : 184/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s82 s83)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-09 finished in 2879 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 (p1||G(p0))))))'
Support contains 3 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 298 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 08:55:52] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:55:52] [INFO ] Invariant cache hit.
[2024-05-25 08:55:53] [INFO ] Dead Transitions using invariants and state equation in 777 ms found 0 transitions.
[2024-05-25 08:55:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:55:53] [INFO ] Invariant cache hit.
[2024-05-25 08:55:53] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-25 08:55:53] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:55:53] [INFO ] Invariant cache hit.
[2024-05-25 08:55:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:55:56] [INFO ] Implicit Places using invariants and state equation in 3111 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3483 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 246 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4809 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT 2 (ADD s166 s167)) (GT 2 s0)), p0:(GT 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 12 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-14 finished in 4990 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 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 235 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
[2024-05-25 08:55:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:55:57] [INFO ] Invariant cache hit.
[2024-05-25 08:55:58] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
[2024-05-25 08:55:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:55:58] [INFO ] Invariant cache hit.
[2024-05-25 08:55:58] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-25 08:55:58] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-25 08:55:58] [INFO ] Invariant cache hit.
[2024-05-25 08:55:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:56:00] [INFO ] Implicit Places using invariants and state equation in 2018 ms returned [83, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2402 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 183/188 places, 2107/2108 transitions.
Applied a total of 0 rules in 235 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3769 ms. Remains : 183/188 places, 2107/2108 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-15 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:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 673 steps with 0 reset in 14 ms.
FORMULA BridgeAndVehicles-COL-V80P50N10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-15 finished in 3954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(G(p1)&&(p2 U (p3||G(p2))))))))'
Found a Shortening insensitive property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-08
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Support contains 9 out of 188 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 4310 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 35 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:56:01] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-25 08:56:01] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 08:56:02] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
[2024-05-25 08:56:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:02] [INFO ] Invariant cache hit.
[2024-05-25 08:56:02] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-25 08:56:02] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:02] [INFO ] Invariant cache hit.
[2024-05-25 08:56:02] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:56:03] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1444 ms to find 0 implicit places.
[2024-05-25 08:56:03] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:03] [INFO ] Invariant cache hit.
[2024-05-25 08:56:04] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 186/188 places, 2108/2108 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3088 ms. Remains : 186/188 places, 2108/2108 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V80P50N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 p1 p3) (AND p0 p1 p2)), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0, 2} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=1 dest: 1}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 2} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(LEQ s84 s0), p1:(LEQ 2 s82), p3:(AND (GT (ADD s184 s185) (ADD s169 s170)) (GT s83 s167)), p2:(GT s83 s167)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 159 reset in 769 ms.
Product exploration explored 100000 steps with 156 reset in 774 ms.
Computed a total of 169 stabilizing places and 324 stable transitions
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p3) p2)), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (OR (AND p0 p1 p3) (AND p0 p1 p2))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 3652 ms. Reduced automaton from 4 states, 15 edges and 4 AP (stutter sensitive) to 10 states, 35 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 751 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-25 08:56:12] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:12] [INFO ] Invariant cache hit.
[2024-05-25 08:56:12] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:8
[2024-05-25 08:56:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:56:13] [INFO ] After 1401ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-25 08:56:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:56:15] [INFO ] After 1389ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :2 sat :8
[2024-05-25 08:56:15] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2024-05-25 08:56:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2024-05-25 08:56:17] [INFO ] After 3451ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 1630 ms.
[2024-05-25 08:56:19] [INFO ] After 6585ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 200 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 182 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:56:19] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:19] [INFO ] Invariant cache hit.
[2024-05-25 08:56:20] [INFO ] Dead Transitions using invariants and state equation in 801 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 985 ms. Remains : 186/186 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 190333 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190333 steps, saw 53059 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-25 08:56:24] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:24] [INFO ] Invariant cache hit.
[2024-05-25 08:56:24] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:56:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:56:25] [INFO ] After 1137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:56:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:56:26] [INFO ] After 1349ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 08:56:27] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2024-05-25 08:56:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2024-05-25 08:56:29] [INFO ] After 3556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1705 ms.
[2024-05-25 08:56:30] [INFO ] After 6509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 177 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 171 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 176 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:56:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:31] [INFO ] Invariant cache hit.
[2024-05-25 08:56:31] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-25 08:56:31] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:31] [INFO ] Invariant cache hit.
[2024-05-25 08:56:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:56:32] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
[2024-05-25 08:56:32] [INFO ] Redundant transitions in 57 ms returned []
[2024-05-25 08:56:32] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:32] [INFO ] Invariant cache hit.
[2024-05-25 08:56:33] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2416 ms. Remains : 186/186 places, 2108/2108 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 186 transition count 370
Applied a total of 1738 rules in 6 ms. Remains 186 /186 variables (removed 0) and now considering 370/2108 (removed 1738) transitions.
Running SMT prover for 8 properties.
[2024-05-25 08:56:33] [INFO ] Invariant cache hit.
[2024-05-25 08:56:33] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:56:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 08:56:35] [INFO ] After 2027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:56:37] [INFO ] After 3589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1838 ms.
[2024-05-25 08:56:39] [INFO ] After 5519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2) p3))), (G (NOT (AND (NOT p0) p1 (NOT p2) p3)))]
False Knowledge obtained : [(X (AND p0 p1 (NOT p3) p2)), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (OR (AND p0 p1 p3) (AND p0 p1 p2))), (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (X (X (AND p0 p1 (NOT p3) p2))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND p0 p1 p3) (AND p0 p1 p2)))), (X (X (NOT (OR (AND p0 p1 p3) (AND p0 p1 p2))))), (X (X (AND p0 (NOT p3) p2))), (X (X (NOT (AND p0 (NOT p3) p2)))), (F (NOT (AND p0 p1))), (F (AND p1 p2 (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (OR (AND p1 p2) (AND p1 p3))), (F (AND p0 (NOT p1))), (F (AND p0 p2 (NOT p3))), (F (AND p0 p1 p2 p3)), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2) (NOT p3))))), (F (OR (AND p0 p1 p2) (AND p0 p1 p3))), (F (NOT (AND p0 (NOT p2) (NOT p3))))]
Knowledge based reduction with 18 factoid took 6167 ms. Reduced automaton from 10 states, 35 edges and 4 AP (stutter insensitive) to 8 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 633 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Stuttering acceptance computed with spot in 595 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 288 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:56:46] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:46] [INFO ] Invariant cache hit.
[2024-05-25 08:56:47] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
[2024-05-25 08:56:47] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:47] [INFO ] Invariant cache hit.
[2024-05-25 08:56:48] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-25 08:56:48] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:48] [INFO ] Invariant cache hit.
[2024-05-25 08:56:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:56:50] [INFO ] Implicit Places using invariants and state equation in 2622 ms returned []
Implicit Place search using SMT with State Equation took 2909 ms to find 0 implicit places.
[2024-05-25 08:56:50] [INFO ] Redundant transitions in 69 ms returned []
[2024-05-25 08:56:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:50] [INFO ] Invariant cache hit.
[2024-05-25 08:56:51] [INFO ] Dead Transitions using invariants and state equation in 811 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4939 ms. Remains : 186/186 places, 2108/2108 transitions.
Computed a total of 169 stabilizing places and 324 stable transitions
Computed a total of 169 stabilizing places and 324 stable transitions
Detected a total of 169/186 stabilizing places and 324/2108 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND p0 p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 p2 (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
Knowledge based reduction with 26 factoid took 6272 ms. Reduced automaton from 8 states, 29 edges and 4 AP (stutter insensitive) to 8 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 507 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 391 ms. (steps per millisecond=25 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 08:56:59] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:56:59] [INFO ] Invariant cache hit.
[2024-05-25 08:56:59] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:57:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:57:01] [INFO ] After 1090ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:57:01] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:57:02] [INFO ] After 1063ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 08:57:03] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 1 ms to minimize.
[2024-05-25 08:57:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2024-05-25 08:57:03] [INFO ] After 2660ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1761 ms.
[2024-05-25 08:57:05] [INFO ] After 5657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 163 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 185 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:57:05] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:05] [INFO ] Invariant cache hit.
[2024-05-25 08:57:06] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1017 ms. Remains : 186/186 places, 2108/2108 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10006 steps, including 5 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10004 steps, including 5 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 184685 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 184685 steps, saw 51533 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-25 08:57:11] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:11] [INFO ] Invariant cache hit.
[2024-05-25 08:57:11] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:57:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 08:57:12] [INFO ] After 1049ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:57:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:57:13] [INFO ] After 1088ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-25 08:57:15] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 1 ms to minimize.
[2024-05-25 08:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2024-05-25 08:57:15] [INFO ] After 2728ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1785 ms.
[2024-05-25 08:57:16] [INFO ] After 5679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 131 ms.
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 179 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 186/186 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 181 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:57:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:17] [INFO ] Invariant cache hit.
[2024-05-25 08:57:17] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-25 08:57:17] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:17] [INFO ] Invariant cache hit.
[2024-05-25 08:57:17] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:57:20] [INFO ] Implicit Places using invariants and state equation in 2323 ms returned []
Implicit Place search using SMT with State Equation took 2675 ms to find 0 implicit places.
[2024-05-25 08:57:20] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-25 08:57:20] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:20] [INFO ] Invariant cache hit.
[2024-05-25 08:57:21] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3739 ms. Remains : 186/186 places, 2108/2108 transitions.
Ensure Unique test removed 1738 transitions
Reduce isomorphic transitions removed 1738 transitions.
Iterating post reduction 0 with 1738 rules applied. Total rules applied 1738 place count 186 transition count 370
Applied a total of 1738 rules in 8 ms. Remains 186 /186 variables (removed 0) and now considering 370/2108 (removed 1738) transitions.
Running SMT prover for 8 properties.
[2024-05-25 08:57:21] [INFO ] Invariant cache hit.
[2024-05-25 08:57:21] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-25 08:57:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 08:57:22] [INFO ] After 822ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-25 08:57:22] [INFO ] After 1579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 735 ms.
[2024-05-25 08:57:23] [INFO ] After 2430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND p0 p1)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND p0 p1 p2))), (X (AND p0 p1 p2 (NOT p3))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (AND p0 p2 (NOT p3))), (X (NOT (AND p0 p2 (NOT p3)))), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1 p2 (NOT p3)))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (AND p0 p2 (NOT p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (F (AND p1 p2 (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (AND p1 p2)), (F (AND p0 (NOT p1))), (F (AND p0 p2 (NOT p3))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (AND p0 p1 p2 p3)), (F (AND p0 p1 p2)), (F (NOT (AND p0 p1))), (F (NOT (AND p0 (NOT p2) (NOT p3))))]
Knowledge based reduction with 26 factoid took 10414 ms. Reduced automaton from 8 states, 29 edges and 4 AP (stutter insensitive) to 8 states, 29 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 645 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Stuttering acceptance computed with spot in 606 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Stuttering acceptance computed with spot in 589 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), false, false, false, false]
Product exploration explored 100000 steps with 162 reset in 1015 ms.
Product exploration explored 100000 steps with 164 reset in 1014 ms.
Built C files in :
/tmp/ltsmin16615409776419400613
[2024-05-25 08:57:38] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:57:38] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16615409776419400613
Running compilation step : cd /tmp/ltsmin16615409776419400613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16615409776419400613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16615409776419400613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 9 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 2108/2108 transitions.
Applied a total of 0 rules in 238 ms. Remains 186 /186 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-25 08:57:41] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:41] [INFO ] Invariant cache hit.
[2024-05-25 08:57:42] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
[2024-05-25 08:57:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:42] [INFO ] Invariant cache hit.
[2024-05-25 08:57:42] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-25 08:57:42] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:42] [INFO ] Invariant cache hit.
[2024-05-25 08:57:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 08:57:44] [INFO ] Implicit Places using invariants and state equation in 1507 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2024-05-25 08:57:44] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-25 08:57:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-25 08:57:44] [INFO ] Invariant cache hit.
[2024-05-25 08:57:44] [INFO ] Dead Transitions using invariants and state equation in 792 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3839 ms. Remains : 186/186 places, 2108/2108 transitions.
Built C files in :
/tmp/ltsmin10135940571888037999
[2024-05-25 08:57:44] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:57:44] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10135940571888037999
Running compilation step : cd /tmp/ltsmin10135940571888037999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10135940571888037999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10135940571888037999;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-25 08:57:48] [INFO ] Flatten gal took : 168 ms
[2024-05-25 08:57:48] [INFO ] Flatten gal took : 159 ms
[2024-05-25 08:57:48] [INFO ] Time to serialize gal into /tmp/LTL17825942434335886856.gal : 30 ms
[2024-05-25 08:57:48] [INFO ] Time to serialize properties into /tmp/LTL6379887517641196709.prop : 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/LTL17825942434335886856.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2811314082918663964.hoa' '-atoms' '/tmp/LTL6379887517641196709.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/LTL6379887517641196709.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2811314082918663964.hoa
Detected timeout of ITS tools.
[2024-05-25 08:58:03] [INFO ] Flatten gal took : 123 ms
[2024-05-25 08:58:03] [INFO ] Flatten gal took : 94 ms
[2024-05-25 08:58:03] [INFO ] Time to serialize gal into /tmp/LTL12713958721059566733.gal : 18 ms
[2024-05-25 08:58:03] [INFO ] Time to serialize properties into /tmp/LTL4713507348194250960.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/LTL12713958721059566733.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4713507348194250960.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(SUR_PONT_A_0<=CAPACITE_0)"))||((G("(ROUTE_A_0>=2)"))&&(("(ATTENTE_A_0>ATTENTE_B_0)")U(("(((VIDANGE_0+VIDANGE_1)>(CONTROLEU...244
Formula 0 simplified : XG(F!"(SUR_PONT_A_0<=CAPACITE_0)" & (F!"(ROUTE_A_0>=2)" | (!"(ATTENTE_A_0>ATTENTE_B_0)" M !"(((VIDANGE_0+VIDANGE_1)>(CONTROLEUR_0+CO...199
Detected timeout of ITS tools.
[2024-05-25 08:58:18] [INFO ] Flatten gal took : 88 ms
[2024-05-25 08:58:18] [INFO ] Applying decomposition
[2024-05-25 08:58:19] [INFO ] Flatten gal took : 97 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/graph10623809530417256038.txt' '-o' '/tmp/graph10623809530417256038.bin' '-w' '/tmp/graph10623809530417256038.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10623809530417256038.bin' '-l' '-1' '-v' '-w' '/tmp/graph10623809530417256038.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:58:19] [INFO ] Decomposing Gal with order
[2024-05-25 08:58:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:58:21] [INFO ] Removed a total of 2411 redundant transitions.
[2024-05-25 08:58:21] [INFO ] Flatten gal took : 2550 ms
[2024-05-25 08:58:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2102 labels/synchronizations in 73 ms.
[2024-05-25 08:58:22] [INFO ] Time to serialize gal into /tmp/LTL2599167603038904000.gal : 9 ms
[2024-05-25 08:58:22] [INFO ] Time to serialize properties into /tmp/LTL13197035183788818952.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/LTL2599167603038904000.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13197035183788818952.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(gu0.SUR_PONT_A_0<=gu0.CAPACITE_0)"))||((G("(gu1.ROUTE_A_0>=2)"))&&(("(gu2.ATTENTE_A_0>gu2.ATTENTE_B_0)")U(("(((gu3.VIDANGE...296
Formula 0 simplified : XG(F!"(gu0.SUR_PONT_A_0<=gu0.CAPACITE_0)" & (F!"(gu1.ROUTE_A_0>=2)" | (!"(gu2.ATTENTE_A_0>gu2.ATTENTE_B_0)" M !"(((gu3.VIDANGE_0+gu3...243
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11815477330978806762
[2024-05-25 08:58:37] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11815477330978806762
Running compilation step : cd /tmp/ltsmin11815477330978806762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11815477330978806762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11815477330978806762;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property BridgeAndVehicles-COL-V80P50N10-LTLCardinality-08 finished in 159207 ms.
[2024-05-25 08:58:40] [INFO ] Flatten gal took : 70 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17646793005393720839
[2024-05-25 08:58:40] [INFO ] Too many transitions (2108) to apply POR reductions. Disabling POR matrices.
[2024-05-25 08:58:40] [INFO ] Applying decomposition
[2024-05-25 08:58:40] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17646793005393720839
Running compilation step : cd /tmp/ltsmin17646793005393720839;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-25 08:58:40] [INFO ] Flatten gal took : 62 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/graph2923848538685074656.txt' '-o' '/tmp/graph2923848538685074656.bin' '-w' '/tmp/graph2923848538685074656.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2923848538685074656.bin' '-l' '-1' '-v' '-w' '/tmp/graph2923848538685074656.weights' '-q' '0' '-e' '0.001'
[2024-05-25 08:58:40] [INFO ] Decomposing Gal with order
[2024-05-25 08:58:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 08:58:42] [INFO ] Removed a total of 2411 redundant transitions.
[2024-05-25 08:58:42] [INFO ] Flatten gal took : 1887 ms
[2024-05-25 08:58:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 2102 labels/synchronizations in 71 ms.
[2024-05-25 08:58:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality18295089625120485515.gal : 10 ms
[2024-05-25 08:58:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality5391054398321215951.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/LTLCardinality18295089625120485515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5391054398321215951.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...298
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(gu0.SUR_PONT_A_0<=gu0.CAPACITE_0)"))||((G("(gu3.ROUTE_A_0>=2)"))&&(("(gu1.ATTENTE_A_0>gu1.ATTENTE_B_0)")U(("(((gu2.VIDANGE...296
Formula 0 simplified : XG(F!"(gu0.SUR_PONT_A_0<=gu0.CAPACITE_0)" & (F!"(gu3.ROUTE_A_0>=2)" | (!"(gu1.ATTENTE_A_0>gu1.ATTENTE_B_0)" M !"(((gu2.VIDANGE_0+gu2...243
Compilation finished in 6037 ms.
Running link step : cd /tmp/ltsmin17646793005393720839;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin17646793005393720839;'/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' 'X(<>(([]((LTLAPp0==true))||([]((LTLAPp1==true))&&((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.001: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: LTL layer: formula: X(<>(([]((LTLAPp0==true))||([]((LTLAPp1==true))&&((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))
pins2lts-mc-linux64( 6/ 8), 0.011: "X(<>(([]((LTLAPp0==true))||([]((LTLAPp1==true))&&((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.011: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.227: There are 2113 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.227: State length is 189, there are 2146 groups
pins2lts-mc-linux64( 0/ 8), 0.227: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.227: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.227: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.227: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.309: [Blue] ~120 levels ~960 states ~3288 transitions
pins2lts-mc-linux64( 6/ 8), 0.360: [Blue] ~206 levels ~1920 states ~5352 transitions
pins2lts-mc-linux64( 6/ 8), 0.459: [Blue] ~431 levels ~3840 states ~8280 transitions
pins2lts-mc-linux64( 6/ 8), 0.631: [Blue] ~677 levels ~7680 states ~15232 transitions
pins2lts-mc-linux64( 6/ 8), 0.924: [Blue] ~677 levels ~15360 states ~32312 transitions
pins2lts-mc-linux64( 6/ 8), 1.551: [Blue] ~678 levels ~30720 states ~81744 transitions
pins2lts-mc-linux64( 6/ 8), 2.670: [Blue] ~678 levels ~61440 states ~183344 transitions
pins2lts-mc-linux64( 6/ 8), 4.821: [Blue] ~678 levels ~122880 states ~400040 transitions
pins2lts-mc-linux64( 6/ 8), 8.872: [Blue] ~678 levels ~245760 states ~840720 transitions
pins2lts-mc-linux64( 6/ 8), 16.535: [Blue] ~678 levels ~491520 states ~1733208 transitions
pins2lts-mc-linux64( 4/ 8), 31.563: [Blue] ~679 levels ~983040 states ~3531928 transitions
pins2lts-mc-linux64( 4/ 8), 60.146: [Blue] ~679 levels ~1966080 states ~7190080 transitions
pins2lts-mc-linux64( 4/ 8), 117.454: [Blue] ~679 levels ~3932160 states ~14488792 transitions
pins2lts-mc-linux64( 5/ 8), 237.021: [Blue] ~676 levels ~7864320 states ~22399424 transitions
pins2lts-mc-linux64( 6/ 8), 478.401: [Blue] ~678 levels ~15728640 states ~59383240 transitions
pins2lts-mc-linux64( 6/ 8), 965.258: [Blue] ~678 levels ~31457280 states ~119183384 transitions
pins2lts-mc-linux64( 3/ 8), 1190.451: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1190.493:
pins2lts-mc-linux64( 0/ 8), 1190.493: Explored 37401602 states 135239703 transitions, fanout: 3.616
pins2lts-mc-linux64( 0/ 8), 1190.493: Total exploration time 1190.260 sec (1190.200 sec minimum, 1190.221 sec on average)
pins2lts-mc-linux64( 0/ 8), 1190.493: States per second: 31423, Transitions per second: 113622
pins2lts-mc-linux64( 0/ 8), 1190.493:
pins2lts-mc-linux64( 0/ 8), 1190.493: State space has 31864979 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 1190.493: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1190.493: blue states: 37401602 (117.38%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1190.493: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1190.493: all-red states: 3137604 (9.85%), bogus 388647 (1.22%)
pins2lts-mc-linux64( 0/ 8), 1190.493:
pins2lts-mc-linux64( 0/ 8), 1190.493: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 1190.493:
pins2lts-mc-linux64( 0/ 8), 1190.493: Queue width: 8B, total height: 5416, memory: 0.04MB
pins2lts-mc-linux64( 0/ 8), 1190.493: Tree memory: 499.1MB, 16.4 B/state, compr.: 2.2%
pins2lts-mc-linux64( 0/ 8), 1190.493: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1190.493: Stored 2427 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1190.493: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1190.493: Est. total memory use: 499.2MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17646793005393720839;'/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' 'X(<>(([]((LTLAPp0==true))||([]((LTLAPp1==true))&&((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17646793005393720839;'/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' 'X(<>(([]((LTLAPp0==true))||([]((LTLAPp1==true))&&((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-25 09:20:56] [INFO ] Applying decomposition
[2024-05-25 09:20:56] [INFO ] Flatten gal took : 120 ms
[2024-05-25 09:20:56] [INFO ] Decomposing Gal with order
[2024-05-25 09:20:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:20:56] [INFO ] Removed a total of 11550 redundant transitions.
[2024-05-25 09:20:56] [INFO ] Flatten gal took : 234 ms
[2024-05-25 09:20:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2024-05-25 09:20:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality14096289381819937264.gal : 21 ms
[2024-05-25 09:20:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality6272797953832255636.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/LTLCardinality14096289381819937264.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6272797953832255636.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...298
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(gSUR_PONT_A.SUR_PONT_A_0<=gCAPACITE.CAPACITE_0)"))||((G("(gROUTE_A.ROUTE_A_0>=2)"))&&(("(gATTENTE_A.ATTENTE_A_0>gATTENTE_B...369
Formula 0 simplified : XG(F!"(gSUR_PONT_A.SUR_PONT_A_0<=gCAPACITE.CAPACITE_0)" & (F!"(gROUTE_A.ROUTE_A_0>=2)" | (!"(gATTENTE_A.ATTENTE_A_0>gATTENTE_B.ATTEN...302
Detected timeout of ITS tools.
[2024-05-25 09:43:13] [INFO ] Flatten gal took : 720 ms
[2024-05-25 09:43:16] [INFO ] Input system was already deterministic with 2108 transitions.
[2024-05-25 09:43:16] [INFO ] Transformed 188 places.
[2024-05-25 09:43:16] [INFO ] Transformed 2108 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-25 09:43:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality9157179595122156878.gal : 42 ms
[2024-05-25 09:43:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality212842114145109041.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/LTLCardinality9157179595122156878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality212842114145109041.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...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F((G("(SUR_PONT_A_0<=CAPACITE_0)"))||((G("(ROUTE_A_0>=2)"))&&(("(ATTENTE_A_0>ATTENTE_B_0)")U(("(((VIDANGE_0+VIDANGE_1)>(CONTROLEU...244
Formula 0 simplified : XG(F!"(SUR_PONT_A_0<=CAPACITE_0)" & (F!"(ROUTE_A_0>=2)" | (!"(ATTENTE_A_0>ATTENTE_B_0)" M !"(((VIDANGE_0+VIDANGE_1)>(CONTROLEUR_0+CO...199
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 12340000 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16171652 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="BridgeAndVehicles-COL-V80P50N10"
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 BridgeAndVehicles-COL-V80P50N10, 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 r065-tajo-171620414400087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 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 ;