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-171620414500162.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-PT-V50P50N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414500162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 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 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M 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-PT-V50P50N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716634341870

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-PT-V50P50N20
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 10:52:23] [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 10:52:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 10:52:23] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-25 10:52:23] [INFO ] Transformed 138 places.
[2024-05-25 10:52:23] [INFO ] Transformed 2348 transitions.
[2024-05-25 10:52:23] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 64 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:52:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-25 10:52:24] [INFO ] Computed 7 invariants in 26 ms
[2024-05-25 10:52:25] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
[2024-05-25 10:52:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:52:25] [INFO ] Invariant cache hit.
[2024-05-25 10:52:25] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-25 10:52:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:52:25] [INFO ] Invariant cache hit.
[2024-05-25 10:52:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:52:26] [INFO ] Implicit Places using invariants and state equation in 1138 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
[2024-05-25 10:52:26] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:52:26] [INFO ] Invariant cache hit.
[2024-05-25 10:52:27] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3748 ms. Remains : 138/138 places, 2348/2348 transitions.
Support contains 22 out of 138 places after structural reductions.
[2024-05-25 10:52:28] [INFO ] Flatten gal took : 354 ms
[2024-05-25 10:52:28] [INFO ] Flatten gal took : 234 ms
[2024-05-25 10:52:29] [INFO ] Input system was already deterministic with 2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 767 ms. (steps per millisecond=13 ) properties (out of 29) seen :21
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10005 steps, including 8 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-05-25 10:52:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:52:31] [INFO ] Invariant cache hit.
[2024-05-25 10:52:31] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-25 10:52:32] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:3
[2024-05-25 10:52:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2024-05-25 10:52:32] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2024-05-25 10:52:32] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:52:32] [INFO ] After 214ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :5 sat :3
[2024-05-25 10:52:33] [INFO ] After 727ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 255 ms.
[2024-05-25 10:52:33] [INFO ] After 1367ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 54 ms.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 554 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:52:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 10:52:34] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:52:45] [INFO ] Dead Transitions using invariants and state equation in 11284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11853 ms. Remains : 135/138 places, 2347/2348 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10005 steps, including 8 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 131515 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131515 steps, saw 35688 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 10:52:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:52:48] [INFO ] Invariant cache hit.
[2024-05-25 10:52:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:52:49] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 10:52:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 10:52:49] [INFO ] After 208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 10:52:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:52:49] [INFO ] After 200ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 10:52:50] [INFO ] After 622ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 160 ms.
[2024-05-25 10:52:50] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 30 ms.
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 556 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 135/135 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 659 ms. Remains 135 /135 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:52:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:52:51] [INFO ] Invariant cache hit.
[2024-05-25 10:52:51] [INFO ] Implicit Places using invariants in 472 ms returned []
[2024-05-25 10:52:51] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:52:51] [INFO ] Invariant cache hit.
[2024-05-25 10:52:52] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:52:52] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1504 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 133/135 places, 2347/2347 transitions.
Applied a total of 0 rules in 242 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2406 ms. Remains : 133/135 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 217319 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 217319 steps, saw 58062 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-25 10:52:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:52:56] [INFO ] Computed 5 invariants in 12 ms
[2024-05-25 10:52:56] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:52:57] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 10:52:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:52:57] [INFO ] After 224ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 10:52:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:52:57] [INFO ] After 145ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 10:52:57] [INFO ] After 469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 281 ms.
[2024-05-25 10:52:58] [INFO ] After 1074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 53 ms.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 183 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 208 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:52:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:52:58] [INFO ] Invariant cache hit.
[2024-05-25 10:52:59] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-25 10:52:59] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:52:59] [INFO ] Invariant cache hit.
[2024-05-25 10:52:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:53:00] [INFO ] Implicit Places using invariants and state equation in 933 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2024-05-25 10:53:00] [INFO ] Redundant transitions in 171 ms returned []
[2024-05-25 10:53:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:53:00] [INFO ] Invariant cache hit.
[2024-05-25 10:53:01] [INFO ] Dead Transitions using invariants and state equation in 879 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2675 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2060 place count 132 transition count 288
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2062 place count 132 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2064 place count 130 transition count 286
Applied a total of 2064 rules in 33 ms. Remains 130 /133 variables (removed 3) and now considering 286/2347 (removed 2061) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 286 rows 130 cols
[2024-05-25 10:53:01] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:53:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 10:53:01] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-25 10:53:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:53:01] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-25 10:53:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 10:53:02] [INFO ] After 128ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-25 10:53:02] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-05-25 10:53:02] [INFO ] After 705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F((G(p0)||X(X(F((!p0&&X(p1))))))))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 16 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:53:02] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 10:53:02] [INFO ] Computed 6 invariants in 6 ms
[2024-05-25 10:53:03] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
[2024-05-25 10:53:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:03] [INFO ] Invariant cache hit.
[2024-05-25 10:53:03] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-25 10:53:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:03] [INFO ] Invariant cache hit.
[2024-05-25 10:53:04] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:53:04] [INFO ] Implicit Places using invariants and state equation in 793 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 29 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2005 ms. Remains : 136/138 places, 2348/2348 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 401 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s111 s108), p1:(LEQ s53 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 251 reset in 743 ms.
Product exploration explored 100000 steps with 249 reset in 639 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.30 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 422 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:53:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-25 10:53:07] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:53:08] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
[2024-05-25 10:53:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:08] [INFO ] Invariant cache hit.
[2024-05-25 10:53:09] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-25 10:53:09] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:09] [INFO ] Invariant cache hit.
[2024-05-25 10:53:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:53:10] [INFO ] Implicit Places using invariants and state equation in 1851 ms returned []
Implicit Place search using SMT with State Equation took 2168 ms to find 0 implicit places.
[2024-05-25 10:53:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:10] [INFO ] Invariant cache hit.
[2024-05-25 10:53:11] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3886 ms. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 389 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 364 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 369 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 244 reset in 773 ms.
Product exploration explored 100000 steps with 256 reset in 666 ms.
Built C files in :
/tmp/ltsmin2955578985320011865
[2024-05-25 10:53:15] [INFO ] Built C files in 100ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2955578985320011865
Running compilation step : cd /tmp/ltsmin2955578985320011865;'/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/ltsmin2955578985320011865;'/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/ltsmin2955578985320011865;'/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 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 27 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:53:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:18] [INFO ] Invariant cache hit.
[2024-05-25 10:53:23] [INFO ] Dead Transitions using invariants and state equation in 5278 ms found 0 transitions.
[2024-05-25 10:53:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:23] [INFO ] Invariant cache hit.
[2024-05-25 10:53:24] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-25 10:53:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:24] [INFO ] Invariant cache hit.
[2024-05-25 10:53:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:53:25] [INFO ] Implicit Places using invariants and state equation in 1290 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2024-05-25 10:53:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:53:25] [INFO ] Invariant cache hit.
[2024-05-25 10:53:26] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7878 ms. Remains : 136/136 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin9277386739979236442
[2024-05-25 10:53:26] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9277386739979236442
Running compilation step : cd /tmp/ltsmin9277386739979236442;'/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/ltsmin9277386739979236442;'/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/ltsmin9277386739979236442;'/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 10:53:30] [INFO ] Flatten gal took : 161 ms
[2024-05-25 10:53:30] [INFO ] Flatten gal took : 166 ms
[2024-05-25 10:53:30] [INFO ] Time to serialize gal into /tmp/LTL12075232394802214684.gal : 54 ms
[2024-05-25 10:53:30] [INFO ] Time to serialize properties into /tmp/LTL16884973565423501291.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/LTL12075232394802214684.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3187545458174291092.hoa' '-atoms' '/tmp/LTL16884973565423501291.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16884973565423501291.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3187545458174291092.hoa
Detected timeout of ITS tools.
[2024-05-25 10:53:45] [INFO ] Flatten gal took : 215 ms
[2024-05-25 10:53:45] [INFO ] Flatten gal took : 134 ms
[2024-05-25 10:53:45] [INFO ] Time to serialize gal into /tmp/LTL4743735938355587743.gal : 54 ms
[2024-05-25 10:53:45] [INFO ] Time to serialize properties into /tmp/LTL7444506506703204453.ltl : 16 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/LTL4743735938355587743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7444506506703204453.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(SUR_PONT_B<=ATTENTE_B)"))||(X(X(F(("(SUR_PONT_B>ATTENTE_B)")&&(X("(SORTI_A<=SUR_PONT_A)")))))))))))
Formula 0 simplified : XXG(F!"(SUR_PONT_B<=ATTENTE_B)" & XXG(!"(SUR_PONT_B>ATTENTE_B)" | X!"(SORTI_A<=SUR_PONT_A)"))
Detected timeout of ITS tools.
[2024-05-25 10:54:01] [INFO ] Flatten gal took : 154 ms
[2024-05-25 10:54:01] [INFO ] Applying decomposition
[2024-05-25 10:54:01] [INFO ] Flatten gal took : 184 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/graph15699314534704666094.txt' '-o' '/tmp/graph15699314534704666094.bin' '-w' '/tmp/graph15699314534704666094.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15699314534704666094.bin' '-l' '-1' '-v' '-w' '/tmp/graph15699314534704666094.weights' '-q' '0' '-e' '0.001'
[2024-05-25 10:54:01] [INFO ] Decomposing Gal with order
[2024-05-25 10:54:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 10:54:03] [INFO ] Removed a total of 2294 redundant transitions.
[2024-05-25 10:54:03] [INFO ] Flatten gal took : 1218 ms
[2024-05-25 10:54:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 384 labels/synchronizations in 23 ms.
[2024-05-25 10:54:03] [INFO ] Time to serialize gal into /tmp/LTL2847583920867573796.gal : 15 ms
[2024-05-25 10:54:03] [INFO ] Time to serialize properties into /tmp/LTL10837240564575150624.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/LTL2847583920867573796.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10837240564575150624.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(X(F((G("(gu2.SUR_PONT_B<=gu2.ATTENTE_B)"))||(X(X(F(("(gu2.SUR_PONT_B>gu2.ATTENTE_B)")&&(X("(gu1.SORTI_A<=gu1.SUR_PONT_A)"))))))))...158
Formula 0 simplified : XXG(F!"(gu2.SUR_PONT_B<=gu2.ATTENTE_B)" & XXG(!"(gu2.SUR_PONT_B>gu2.ATTENTE_B)" | X!"(gu1.SORTI_A<=gu1.SUR_PONT_A)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13186113565461895397
[2024-05-25 10:54:18] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13186113565461895397
Running compilation step : cd /tmp/ltsmin13186113565461895397;'/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/ltsmin13186113565461895397;'/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/ltsmin13186113565461895397;'/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-PT-V50P50N20-LTLCardinality-00 finished in 78967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(((p0&&G(p1)) U X((p2 U p3))))&&F(p1)))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 20 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:54:21] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 10:54:21] [INFO ] Computed 6 invariants in 5 ms
[2024-05-25 10:54:22] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
[2024-05-25 10:54:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:54:22] [INFO ] Invariant cache hit.
[2024-05-25 10:54:22] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-25 10:54:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:54:22] [INFO ] Invariant cache hit.
[2024-05-25 10:54:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:24] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1611 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2452 ms. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 417 ms :[(OR (NOT p1) (NOT p3)), (NOT p3), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 1 (ADD s108 s109)), p0:(LEQ 1 s114), p3:(LEQ (ADD s108 s109) s113), p2:(AND (LEQ 3 s107) (LEQ 1 s114))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-04 finished in 2928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (p1||G(p0)))||F((G(F(p2))||(p0&&F(p2)))))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:54:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-25 10:54:24] [INFO ] Computed 7 invariants in 6 ms
[2024-05-25 10:54:25] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
[2024-05-25 10:54:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:54:25] [INFO ] Invariant cache hit.
[2024-05-25 10:54:25] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-25 10:54:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:54:25] [INFO ] Invariant cache hit.
[2024-05-25 10:54:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:26] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1630 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2365 ms. Remains : 136/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 1 s53), p1:(GT s110 s52), p2:(OR (LEQ s114 s113) (LEQ s110 s52))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1245 ms.
Product exploration explored 100000 steps with 50000 reset in 1150 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3642 edges and 136 vertex of which 134 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 48 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-05 finished in 5136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 34 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:54:29] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 10:54:29] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:54:30] [INFO ] Dead Transitions using invariants and state equation in 791 ms found 0 transitions.
[2024-05-25 10:54:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:30] [INFO ] Invariant cache hit.
[2024-05-25 10:54:30] [INFO ] Implicit Places using invariants in 399 ms returned []
[2024-05-25 10:54:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:30] [INFO ] Invariant cache hit.
[2024-05-25 10:54:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:32] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1535 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2376 ms. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s53)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 241 reset in 791 ms.
Product exploration explored 100000 steps with 241 reset in 579 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 340974 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 340974 steps, saw 90704 distinct states, run finished after 3005 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 10:54:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:54:37] [INFO ] Computed 5 invariants in 11 ms
[2024-05-25 10:54:37] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:54:37] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:54:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:54:37] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:37] [INFO ] After 80ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:37] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 163 ms.
[2024-05-25 10:54:37] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 228 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:54:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:38] [INFO ] Invariant cache hit.
[2024-05-25 10:54:39] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1132 ms. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 354347 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354347 steps, saw 94281 distinct states, run finished after 3001 ms. (steps per millisecond=118 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 10:54:42] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:42] [INFO ] Invariant cache hit.
[2024-05-25 10:54:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:54:42] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:54:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:54:42] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:42] [INFO ] After 178ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:43] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-25 10:54:43] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 246 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 217 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:54:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:43] [INFO ] Invariant cache hit.
[2024-05-25 10:54:43] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-05-25 10:54:43] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:43] [INFO ] Invariant cache hit.
[2024-05-25 10:54:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:45] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-25 10:54:45] [INFO ] Redundant transitions in 161 ms returned []
[2024-05-25 10:54:45] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:45] [INFO ] Invariant cache hit.
[2024-05-25 10:54:46] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2825 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 13 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 10:54:46] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:54:46] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:54:46] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:54:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 10:54:46] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 10:54:46] [INFO ] After 19ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:46] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-25 10:54:46] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 669 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:54:47] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:54:47] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:54:48] [INFO ] Dead Transitions using invariants and state equation in 819 ms found 0 transitions.
[2024-05-25 10:54:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:48] [INFO ] Invariant cache hit.
[2024-05-25 10:54:48] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-25 10:54:48] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:48] [INFO ] Invariant cache hit.
[2024-05-25 10:54:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:49] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2024-05-25 10:54:49] [INFO ] Redundant transitions in 79 ms returned []
[2024-05-25 10:54:49] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:49] [INFO ] Invariant cache hit.
[2024-05-25 10:54:50] [INFO ] Dead Transitions using invariants and state equation in 850 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3676 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 271468 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 271468 steps, saw 72667 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 10:54:53] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:53] [INFO ] Invariant cache hit.
[2024-05-25 10:54:53] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:54:54] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:54:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:54:54] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:54] [INFO ] After 105ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:54] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-25 10:54:54] [INFO ] After 479ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 305 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:54:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:54] [INFO ] Invariant cache hit.
[2024-05-25 10:54:55] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1159 ms. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10002 steps, including 23 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10014 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 341145 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :{}
Probabilistic random walk after 341145 steps, saw 90746 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 10:54:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:54:58] [INFO ] Invariant cache hit.
[2024-05-25 10:54:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 10:54:59] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:54:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:54:59] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:54:59] [INFO ] After 134ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:54:59] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-25 10:54:59] [INFO ] After 563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 296 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 259 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:55:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:55:00] [INFO ] Invariant cache hit.
[2024-05-25 10:55:00] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-05-25 10:55:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:55:00] [INFO ] Invariant cache hit.
[2024-05-25 10:55:00] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:55:01] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
[2024-05-25 10:55:01] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-25 10:55:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:55:01] [INFO ] Invariant cache hit.
[2024-05-25 10:55:02] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2629 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 20 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 10:55:02] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:55:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:55:02] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:55:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:55:02] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:55:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 10:55:02] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:55:02] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-25 10:55:02] [INFO ] After 183ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 241 reset in 733 ms.
Product exploration explored 100000 steps with 241 reset in 572 ms.
Built C files in :
/tmp/ltsmin13842484936824547835
[2024-05-25 10:55:04] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2024-05-25 10:55:04] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13842484936824547835
Running compilation step : cd /tmp/ltsmin13842484936824547835;'/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/ltsmin13842484936824547835;'/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/ltsmin13842484936824547835;'/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 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 263 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:55:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:55:07] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:55:08] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
[2024-05-25 10:55:08] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:55:08] [INFO ] Invariant cache hit.
[2024-05-25 10:55:09] [INFO ] Implicit Places using invariants in 319 ms returned []
[2024-05-25 10:55:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:55:09] [INFO ] Invariant cache hit.
[2024-05-25 10:55:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:55:09] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
[2024-05-25 10:55:10] [INFO ] Redundant transitions in 62 ms returned []
[2024-05-25 10:55:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:55:10] [INFO ] Invariant cache hit.
[2024-05-25 10:55:10] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3202 ms. Remains : 133/133 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin7945316238850983172
[2024-05-25 10:55:10] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2024-05-25 10:55:10] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7945316238850983172
Running compilation step : cd /tmp/ltsmin7945316238850983172;'/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/ltsmin7945316238850983172;'/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/ltsmin7945316238850983172;'/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 10:55:14] [INFO ] Flatten gal took : 157 ms
[2024-05-25 10:55:14] [INFO ] Flatten gal took : 126 ms
[2024-05-25 10:55:14] [INFO ] Time to serialize gal into /tmp/LTL8728303631104964907.gal : 17 ms
[2024-05-25 10:55:14] [INFO ] Time to serialize properties into /tmp/LTL4970611554313203729.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/LTL8728303631104964907.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7399085110950223018.hoa' '-atoms' '/tmp/LTL4970611554313203729.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/LTL4970611554313203729.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7399085110950223018.hoa
Detected timeout of ITS tools.
[2024-05-25 10:55:29] [INFO ] Flatten gal took : 85 ms
[2024-05-25 10:55:29] [INFO ] Flatten gal took : 95 ms
[2024-05-25 10:55:29] [INFO ] Time to serialize gal into /tmp/LTL11882741331936230854.gal : 16 ms
[2024-05-25 10:55:29] [INFO ] Time to serialize properties into /tmp/LTL3522115910148904279.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/LTL11882741331936230854.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3522115910148904279.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(G("(CAPACITE>=3)"))))
Formula 0 simplified : XF!"(CAPACITE>=3)"
Detected timeout of ITS tools.
[2024-05-25 10:55:44] [INFO ] Flatten gal took : 75 ms
[2024-05-25 10:55:44] [INFO ] Applying decomposition
[2024-05-25 10:55:44] [INFO ] Flatten gal took : 81 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/graph1245257897850180697.txt' '-o' '/tmp/graph1245257897850180697.bin' '-w' '/tmp/graph1245257897850180697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1245257897850180697.bin' '-l' '-1' '-v' '-w' '/tmp/graph1245257897850180697.weights' '-q' '0' '-e' '0.001'
[2024-05-25 10:55:45] [INFO ] Decomposing Gal with order
[2024-05-25 10:55:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 10:55:45] [INFO ] Removed a total of 4373 redundant transitions.
[2024-05-25 10:55:45] [INFO ] Flatten gal took : 729 ms
[2024-05-25 10:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 27 ms.
[2024-05-25 10:55:46] [INFO ] Time to serialize gal into /tmp/LTL8410304138087105213.gal : 3 ms
[2024-05-25 10:55:46] [INFO ] Time to serialize properties into /tmp/LTL14000769600233232680.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/LTL8410304138087105213.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14000769600233232680.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(u0.CAPACITE>=3)"))))
Formula 0 simplified : XF!"(u0.CAPACITE>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15272257128981095263
[2024-05-25 10:56:01] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15272257128981095263
Running compilation step : cd /tmp/ltsmin15272257128981095263;'/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/ltsmin15272257128981095263;'/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/ltsmin15272257128981095263;'/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-PT-V50P50N20-LTLCardinality-06 finished in 94416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 2348
Applied a total of 1 rules in 14 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:56:04] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 10:56:04] [INFO ] Computed 6 invariants in 6 ms
[2024-05-25 10:56:05] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
[2024-05-25 10:56:05] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:05] [INFO ] Invariant cache hit.
[2024-05-25 10:56:05] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-25 10:56:05] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:05] [INFO ] Invariant cache hit.
[2024-05-25 10:56:05] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:56:06] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1744 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 15 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2595 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 1 s112), p0:(GT 1 s107)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 162 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-09 finished in 2828 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 23 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:56:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-25 10:56:07] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:56:07] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
[2024-05-25 10:56:07] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:07] [INFO ] Invariant cache hit.
[2024-05-25 10:56:08] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-25 10:56:08] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:08] [INFO ] Invariant cache hit.
[2024-05-25 10:56:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:56:09] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1647 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 21 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2626 ms. Remains : 134/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s53 s111), p1:(LEQ s109 s86)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 418 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-10 finished in 2743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 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 135 transition count 2347
Applied a total of 3 rules in 307 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:56:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 10:56:10] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:56:10] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
[2024-05-25 10:56:10] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:56:10] [INFO ] Invariant cache hit.
[2024-05-25 10:56:11] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-05-25 10:56:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:56:11] [INFO ] Invariant cache hit.
[2024-05-25 10:56:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:56:12] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1516 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 263 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2958 ms. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 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}]], initial=1, aps=[p0:(LEQ s52 s109)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-11 finished in 3082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U G(p1))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2347
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2347
Applied a total of 4 rules in 46 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:56:12] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 10:56:12] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:56:13] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
[2024-05-25 10:56:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:56:13] [INFO ] Invariant cache hit.
[2024-05-25 10:56:14] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-05-25 10:56:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:56:14] [INFO ] Invariant cache hit.
[2024-05-25 10:56:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:56:15] [INFO ] Implicit Places using invariants and state equation in 1292 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1697 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 27 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2685 ms. Remains : 133/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 412 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-12 finished in 3036 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 291 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:56:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:56:16] [INFO ] Invariant cache hit.
[2024-05-25 10:56:16] [INFO ] Dead Transitions using invariants and state equation in 809 ms found 0 transitions.
[2024-05-25 10:56:16] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:56:16] [INFO ] Invariant cache hit.
[2024-05-25 10:56:17] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-25 10:56:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:56:17] [INFO ] Invariant cache hit.
[2024-05-25 10:56:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:56:19] [INFO ] Implicit Places using invariants and state equation in 2155 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2538 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 226 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3867 ms. Remains : 134/138 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ s53 s129) (AND (LEQ 2 s0) (LEQ 2 s107)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13899 reset in 792 ms.
Product exploration explored 100000 steps with 13885 reset in 791 ms.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2024-05-25 10:56:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2024-05-25 10:56:22] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:56:23] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 254 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V50P50N20-LTLCardinality-13 finished in 7873 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)&&F(G(p1)))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 337 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:56:24] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 10:56:24] [INFO ] Computed 6 invariants in 4 ms
[2024-05-25 10:56:25] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
[2024-05-25 10:56:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:25] [INFO ] Invariant cache hit.
[2024-05-25 10:56:25] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-25 10:56:25] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:25] [INFO ] Invariant cache hit.
[2024-05-25 10:56:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:56:26] [INFO ] Implicit Places using invariants and state equation in 998 ms returned [52, 109]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1332 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 236 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3019 ms. Remains : 135/138 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s76), p1:(AND (LEQ s53 s113) (GT s54 s127))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1276 reset in 666 ms.
Product exploration explored 100000 steps with 1273 reset in 539 ms.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3641 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 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 p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 226 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 117 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-25 10:56:29] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 135 cols
[2024-05-25 10:56:29] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:56:29] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:56:30] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-25 10:56:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:56:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:56:31] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-25 10:56:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:56:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 318 ms returned sat
[2024-05-25 10:56:31] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 143 ms.
[2024-05-25 10:56:31] [INFO ] Added : 40 causal constraints over 9 iterations in 396 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 238 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:56:32] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:32] [INFO ] Invariant cache hit.
[2024-05-25 10:56:33] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
[2024-05-25 10:56:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:33] [INFO ] Invariant cache hit.
[2024-05-25 10:56:33] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-25 10:56:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:33] [INFO ] Invariant cache hit.
[2024-05-25 10:56:34] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 977 ms to find 0 implicit places.
[2024-05-25 10:56:34] [INFO ] Redundant transitions in 65 ms returned []
[2024-05-25 10:56:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:34] [INFO ] Invariant cache hit.
[2024-05-25 10:56:34] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3033 ms. Remains : 135/135 places, 2348/2348 transitions.
Computed a total of 108 stabilizing places and 204 stable transitions
Graph (complete) has 3641 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 108 stabilizing places and 204 stable transitions
Detected a total of 108/135 stabilizing places and 204/2348 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 p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 148 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 140 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-25 10:56:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:36] [INFO ] Invariant cache hit.
[2024-05-25 10:56:36] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:56:37] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-05-25 10:56:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:56:37] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:56:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:56:38] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2024-05-25 10:56:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:56:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 473 ms returned sat
[2024-05-25 10:56:38] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 78 ms.
[2024-05-25 10:56:38] [INFO ] Added : 40 causal constraints over 9 iterations in 302 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1261 reset in 549 ms.
Product exploration explored 100000 steps with 1259 reset in 551 ms.
Built C files in :
/tmp/ltsmin4206521045168525090
[2024-05-25 10:56:40] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2024-05-25 10:56:40] [INFO ] Built C files in 56ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4206521045168525090
Running compilation step : cd /tmp/ltsmin4206521045168525090;'/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/ltsmin4206521045168525090;'/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/ltsmin4206521045168525090;'/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 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 2348/2348 transitions.
Applied a total of 0 rules in 227 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:56:43] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:43] [INFO ] Invariant cache hit.
[2024-05-25 10:56:44] [INFO ] Dead Transitions using invariants and state equation in 874 ms found 0 transitions.
[2024-05-25 10:56:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:44] [INFO ] Invariant cache hit.
[2024-05-25 10:56:44] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-25 10:56:44] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:44] [INFO ] Invariant cache hit.
[2024-05-25 10:56:45] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2024-05-25 10:56:45] [INFO ] Redundant transitions in 65 ms returned []
[2024-05-25 10:56:45] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:56:45] [INFO ] Invariant cache hit.
[2024-05-25 10:56:46] [INFO ] Dead Transitions using invariants and state equation in 884 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3291 ms. Remains : 135/135 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin15480272570972900381
[2024-05-25 10:56:46] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2024-05-25 10:56:46] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15480272570972900381
Running compilation step : cd /tmp/ltsmin15480272570972900381;'/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/ltsmin15480272570972900381;'/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/ltsmin15480272570972900381;'/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 10:56:49] [INFO ] Flatten gal took : 121 ms
[2024-05-25 10:56:49] [INFO ] Flatten gal took : 148 ms
[2024-05-25 10:56:49] [INFO ] Time to serialize gal into /tmp/LTL16124807892748199652.gal : 18 ms
[2024-05-25 10:56:49] [INFO ] Time to serialize properties into /tmp/LTL13407402421536937324.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/LTL16124807892748199652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7718348704616683065.hoa' '-atoms' '/tmp/LTL13407402421536937324.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13407402421536937324.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7718348704616683065.hoa
Detected timeout of ITS tools.
[2024-05-25 10:57:05] [INFO ] Flatten gal took : 96 ms
[2024-05-25 10:57:05] [INFO ] Flatten gal took : 127 ms
[2024-05-25 10:57:05] [INFO ] Time to serialize gal into /tmp/LTL5845757259330467308.gal : 18 ms
[2024-05-25 10:57:05] [INFO ] Time to serialize properties into /tmp/LTL15510353224029424861.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/LTL5845757259330467308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15510353224029424861.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(NB_ATTENTE_B_19>=1)"))&&(F(G("((SORTI_A<=ROUTE_B)&&(CAPACITE>COMPTEUR_13))"))))))
Formula 0 simplified : F(G!"(NB_ATTENTE_B_19>=1)" | GF!"((SORTI_A<=ROUTE_B)&&(CAPACITE>COMPTEUR_13))")
Detected timeout of ITS tools.
[2024-05-25 10:57:20] [INFO ] Flatten gal took : 112 ms
[2024-05-25 10:57:20] [INFO ] Applying decomposition
[2024-05-25 10:57:20] [INFO ] Flatten gal took : 95 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/graph17862650826637814852.txt' '-o' '/tmp/graph17862650826637814852.bin' '-w' '/tmp/graph17862650826637814852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17862650826637814852.bin' '-l' '-1' '-v' '-w' '/tmp/graph17862650826637814852.weights' '-q' '0' '-e' '0.001'
[2024-05-25 10:57:20] [INFO ] Decomposing Gal with order
[2024-05-25 10:57:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 10:57:21] [INFO ] Removed a total of 2398 redundant transitions.
[2024-05-25 10:57:21] [INFO ] Flatten gal took : 532 ms
[2024-05-25 10:57:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 533 labels/synchronizations in 28 ms.
[2024-05-25 10:57:21] [INFO ] Time to serialize gal into /tmp/LTL18385381804978934855.gal : 10 ms
[2024-05-25 10:57:21] [INFO ] Time to serialize properties into /tmp/LTL18051895379998473652.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/LTL18385381804978934855.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18051895379998473652.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F("(gi1.gu2.NB_ATTENTE_B_19>=1)"))&&(F(G("((gu0.SORTI_A<=gu0.ROUTE_B)&&(gu3.CAPACITE>gu3.COMPTEUR_13))"))))))
Formula 0 simplified : F(G!"(gi1.gu2.NB_ATTENTE_B_19>=1)" | GF!"((gu0.SORTI_A<=gu0.ROUTE_B)&&(gu3.CAPACITE>gu3.COMPTEUR_13))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17723911493431146947
[2024-05-25 10:57:36] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17723911493431146947
Running compilation step : cd /tmp/ltsmin17723911493431146947;'/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/ltsmin17723911493431146947;'/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/ltsmin17723911493431146947;'/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-PT-V50P50N20-LTLCardinality-14 finished in 76119 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(F((G(p0)||X(X(F((!p0&&X(p1))))))))))'
Found a Shortening insensitive property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 63 ms. Remains 137 /138 variables (removed 1) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:57:40] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 137 cols
[2024-05-25 10:57:40] [INFO ] Computed 6 invariants in 14 ms
[2024-05-25 10:57:41] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
[2024-05-25 10:57:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:57:41] [INFO ] Invariant cache hit.
[2024-05-25 10:57:41] [INFO ] Implicit Places using invariants in 482 ms returned []
[2024-05-25 10:57:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:57:41] [INFO ] Invariant cache hit.
[2024-05-25 10:57:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:57:43] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1827 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 43 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2872 ms. Remains : 136/138 places, 2348/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(LEQ s111 s108), p1:(LEQ s53 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 250 reset in 750 ms.
Product exploration explored 100000 steps with 253 reset in 814 ms.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 393 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 351 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 406 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:57:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-25 10:57:46] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:57:47] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
[2024-05-25 10:57:47] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:57:47] [INFO ] Invariant cache hit.
[2024-05-25 10:57:48] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-25 10:57:48] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:57:48] [INFO ] Invariant cache hit.
[2024-05-25 10:57:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:57:49] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
[2024-05-25 10:57:49] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:57:49] [INFO ] Invariant cache hit.
[2024-05-25 10:57:50] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4022 ms. Remains : 136/136 places, 2348/2348 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Graph (complete) has 3745 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 109 stabilizing places and 204 stable transitions
Detected a total of 109/136 stabilizing places and 204/2348 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 392 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 315 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 463 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 251 reset in 875 ms.
Product exploration explored 100000 steps with 247 reset in 738 ms.
Built C files in :
/tmp/ltsmin15391966179193282381
[2024-05-25 10:57:54] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15391966179193282381
Running compilation step : cd /tmp/ltsmin15391966179193282381;'/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/ltsmin15391966179193282381;'/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/ltsmin15391966179193282381;'/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 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-25 10:57:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:57:58] [INFO ] Invariant cache hit.
[2024-05-25 10:57:58] [INFO ] Dead Transitions using invariants and state equation in 845 ms found 0 transitions.
[2024-05-25 10:57:58] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:57:58] [INFO ] Invariant cache hit.
[2024-05-25 10:57:59] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-25 10:57:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:57:59] [INFO ] Invariant cache hit.
[2024-05-25 10:57:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:58:00] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
[2024-05-25 10:58:00] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-25 10:58:00] [INFO ] Invariant cache hit.
[2024-05-25 10:58:01] [INFO ] Dead Transitions using invariants and state equation in 1117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3402 ms. Remains : 136/136 places, 2348/2348 transitions.
Built C files in :
/tmp/ltsmin17088642251738564124
[2024-05-25 10:58:01] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17088642251738564124
Running compilation step : cd /tmp/ltsmin17088642251738564124;'/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/ltsmin17088642251738564124;'/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/ltsmin17088642251738564124;'/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 10:58:04] [INFO ] Flatten gal took : 105 ms
[2024-05-25 10:58:04] [INFO ] Flatten gal took : 95 ms
[2024-05-25 10:58:04] [INFO ] Time to serialize gal into /tmp/LTL10283002019070656113.gal : 20 ms
[2024-05-25 10:58:04] [INFO ] Time to serialize properties into /tmp/LTL14728882962184109228.prop : 2 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/LTL10283002019070656113.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8902873994059533576.hoa' '-atoms' '/tmp/LTL14728882962184109228.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14728882962184109228.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8902873994059533576.hoa
Detected timeout of ITS tools.
[2024-05-25 10:58:20] [INFO ] Flatten gal took : 89 ms
[2024-05-25 10:58:20] [INFO ] Flatten gal took : 94 ms
[2024-05-25 10:58:20] [INFO ] Time to serialize gal into /tmp/LTL1302014400564537670.gal : 27 ms
[2024-05-25 10:58:20] [INFO ] Time to serialize properties into /tmp/LTL4528368737867468892.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/LTL1302014400564537670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4528368737867468892.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(SUR_PONT_B<=ATTENTE_B)"))||(X(X(F(("(SUR_PONT_B>ATTENTE_B)")&&(X("(SORTI_A<=SUR_PONT_A)")))))))))))
Formula 0 simplified : XXG(F!"(SUR_PONT_B<=ATTENTE_B)" & XXG(!"(SUR_PONT_B>ATTENTE_B)" | X!"(SORTI_A<=SUR_PONT_A)"))
Detected timeout of ITS tools.
[2024-05-25 10:58:35] [INFO ] Flatten gal took : 115 ms
[2024-05-25 10:58:35] [INFO ] Applying decomposition
[2024-05-25 10:58:35] [INFO ] Flatten gal took : 99 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/graph1085280053155631195.txt' '-o' '/tmp/graph1085280053155631195.bin' '-w' '/tmp/graph1085280053155631195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1085280053155631195.bin' '-l' '-1' '-v' '-w' '/tmp/graph1085280053155631195.weights' '-q' '0' '-e' '0.001'
[2024-05-25 10:58:35] [INFO ] Decomposing Gal with order
[2024-05-25 10:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 10:58:36] [INFO ] Removed a total of 2294 redundant transitions.
[2024-05-25 10:58:36] [INFO ] Flatten gal took : 476 ms
[2024-05-25 10:58:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 384 labels/synchronizations in 16 ms.
[2024-05-25 10:58:36] [INFO ] Time to serialize gal into /tmp/LTL16088985774770483422.gal : 9 ms
[2024-05-25 10:58:36] [INFO ] Time to serialize properties into /tmp/LTL2016287679492185948.ltl : 2 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/LTL16088985774770483422.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2016287679492185948.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(X(F((G("(gu2.SUR_PONT_B<=gu2.ATTENTE_B)"))||(X(X(F(("(gu2.SUR_PONT_B>gu2.ATTENTE_B)")&&(X("(gu1.SORTI_A<=gu1.SUR_PONT_A)"))))))))...158
Formula 0 simplified : XXG(F!"(gu2.SUR_PONT_B<=gu2.ATTENTE_B)" & XXG(!"(gu2.SUR_PONT_B>gu2.ATTENTE_B)" | X!"(gu1.SORTI_A<=gu1.SUR_PONT_A)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5833500171155146458
[2024-05-25 10:58:51] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5833500171155146458
Running compilation step : cd /tmp/ltsmin5833500171155146458;'/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/ltsmin5833500171155146458;'/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/ltsmin5833500171155146458;'/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-PT-V50P50N20-LTLCardinality-00 finished in 74773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 3850 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2347
Applied a total of 3 rules in 36 ms. Remains 135 /138 variables (removed 3) and now considering 2347/2348 (removed 1) transitions.
[2024-05-25 10:58:54] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-25 10:58:54] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:58:55] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
[2024-05-25 10:58:55] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:58:55] [INFO ] Invariant cache hit.
[2024-05-25 10:58:56] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-25 10:58:56] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:58:56] [INFO ] Invariant cache hit.
[2024-05-25 10:58:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:58:57] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1690 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 133/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 50 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2661 ms. Remains : 133/138 places, 2347/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V50P50N20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s53)], 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 241 reset in 780 ms.
Product exploration explored 100000 steps with 241 reset in 608 ms.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 319583 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 319583 steps, saw 85255 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 10:59:02] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:59:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 10:59:02] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:59:02] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:59:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:59:02] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:02] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:59:02] [INFO ] After 58ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:03] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 176 ms.
[2024-05-25 10:59:03] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 284 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:59:03] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:03] [INFO ] Invariant cache hit.
[2024-05-25 10:59:04] [INFO ] Dead Transitions using invariants and state equation in 1258 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1544 ms. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 310712 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310712 steps, saw 82957 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 10:59:07] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:07] [INFO ] Invariant cache hit.
[2024-05-25 10:59:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:59:08] [INFO ] After 318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:59:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-25 10:59:08] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:59:08] [INFO ] After 171ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:08] [INFO ] After 273ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2024-05-25 10:59:08] [INFO ] After 737ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 261 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 262 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 226 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:59:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:09] [INFO ] Invariant cache hit.
[2024-05-25 10:59:09] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-25 10:59:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:09] [INFO ] Invariant cache hit.
[2024-05-25 10:59:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:59:11] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
[2024-05-25 10:59:11] [INFO ] Redundant transitions in 75 ms returned []
[2024-05-25 10:59:11] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:11] [INFO ] Invariant cache hit.
[2024-05-25 10:59:11] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2785 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
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 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 11 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 10:59:12] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:59:12] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:59:12] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:59:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:59:12] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 10:59:12] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:12] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-25 10:59:12] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0)]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 273 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:59:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:59:13] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 10:59:13] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
[2024-05-25 10:59:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:13] [INFO ] Invariant cache hit.
[2024-05-25 10:59:14] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-25 10:59:14] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:14] [INFO ] Invariant cache hit.
[2024-05-25 10:59:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:59:15] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2024-05-25 10:59:15] [INFO ] Redundant transitions in 45 ms returned []
[2024-05-25 10:59:15] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:15] [INFO ] Invariant cache hit.
[2024-05-25 10:59:16] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3329 ms. Remains : 133/133 places, 2347/2347 transitions.
Computed a total of 106 stabilizing places and 203 stable transitions
Computed a total of 106 stabilizing places and 203 stable transitions
Detected a total of 106/133 stabilizing places and 203/2347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 324694 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324694 steps, saw 86574 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 10:59:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:19] [INFO ] Invariant cache hit.
[2024-05-25 10:59:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:59:19] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:59:19] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:59:20] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:59:20] [INFO ] After 138ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:20] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2024-05-25 10:59:20] [INFO ] After 675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 265 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:59:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:20] [INFO ] Invariant cache hit.
[2024-05-25 10:59:21] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1138 ms. Remains : 133/133 places, 2347/2347 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 299178 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 299178 steps, saw 79967 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 10:59:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:24] [INFO ] Invariant cache hit.
[2024-05-25 10:59:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:59:24] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:59:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:59:25] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:59:25] [INFO ] After 139ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:25] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2024-05-25 10:59:25] [INFO ] After 652ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 254 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 133/133 places, 2347/2347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 238 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:59:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:26] [INFO ] Invariant cache hit.
[2024-05-25 10:59:26] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-25 10:59:26] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:26] [INFO ] Invariant cache hit.
[2024-05-25 10:59:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:59:27] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2024-05-25 10:59:27] [INFO ] Redundant transitions in 76 ms returned []
[2024-05-25 10:59:27] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:27] [INFO ] Invariant cache hit.
[2024-05-25 10:59:28] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2776 ms. Remains : 133/133 places, 2347/2347 transitions.
Ensure Unique test removed 2058 transitions
Reduce isomorphic transitions removed 2058 transitions.
Iterating post reduction 0 with 2058 rules applied. Total rules applied 2058 place count 133 transition count 289
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2062 place count 131 transition count 287
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 2064 place count 131 transition count 285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 2066 place count 129 transition count 285
Applied a total of 2066 rules in 10 ms. Remains 129 /133 variables (removed 4) and now considering 285/2347 (removed 2062) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 129 cols
[2024-05-25 10:59:28] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:59:28] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:59:28] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 10:59:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:59:28] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 10:59:28] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 10:59:29] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-05-25 10:59:29] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 241 reset in 773 ms.
Product exploration explored 100000 steps with 241 reset in 596 ms.
Built C files in :
/tmp/ltsmin15674722345688729766
[2024-05-25 10:59:30] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2024-05-25 10:59:30] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15674722345688729766
Running compilation step : cd /tmp/ltsmin15674722345688729766;'/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/ltsmin15674722345688729766;'/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/ltsmin15674722345688729766;'/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 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 252 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2024-05-25 10:59:34] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2024-05-25 10:59:34] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:59:35] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
[2024-05-25 10:59:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:35] [INFO ] Invariant cache hit.
[2024-05-25 10:59:35] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-25 10:59:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:35] [INFO ] Invariant cache hit.
[2024-05-25 10:59:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-25 10:59:36] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2024-05-25 10:59:36] [INFO ] Redundant transitions in 72 ms returned []
[2024-05-25 10:59:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
[2024-05-25 10:59:36] [INFO ] Invariant cache hit.
[2024-05-25 10:59:37] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3549 ms. Remains : 133/133 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin16244734116185762779
[2024-05-25 10:59:37] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2024-05-25 10:59:37] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16244734116185762779
Running compilation step : cd /tmp/ltsmin16244734116185762779;'/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/ltsmin16244734116185762779;'/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/ltsmin16244734116185762779;'/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 10:59:40] [INFO ] Flatten gal took : 72 ms
[2024-05-25 10:59:40] [INFO ] Flatten gal took : 82 ms
[2024-05-25 10:59:40] [INFO ] Time to serialize gal into /tmp/LTL12073566373665275971.gal : 15 ms
[2024-05-25 10:59:40] [INFO ] Time to serialize properties into /tmp/LTL564791800891002043.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12073566373665275971.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15681546831394046753.hoa' '-atoms' '/tmp/LTL564791800891002043.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/LTL564791800891002043.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15681546831394046753.hoa
Detected timeout of ITS tools.
[2024-05-25 10:59:56] [INFO ] Flatten gal took : 96 ms
[2024-05-25 10:59:56] [INFO ] Flatten gal took : 100 ms
[2024-05-25 10:59:56] [INFO ] Time to serialize gal into /tmp/LTL7553403640158634977.gal : 19 ms
[2024-05-25 10:59:56] [INFO ] Time to serialize properties into /tmp/LTL2201015318850088524.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/LTL7553403640158634977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2201015318850088524.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G("(CAPACITE>=3)"))))
Formula 0 simplified : XF!"(CAPACITE>=3)"
Detected timeout of ITS tools.
[2024-05-25 11:00:11] [INFO ] Flatten gal took : 110 ms
[2024-05-25 11:00:11] [INFO ] Applying decomposition
[2024-05-25 11:00:11] [INFO ] Flatten gal took : 100 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/graph4764038021159784415.txt' '-o' '/tmp/graph4764038021159784415.bin' '-w' '/tmp/graph4764038021159784415.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4764038021159784415.bin' '-l' '-1' '-v' '-w' '/tmp/graph4764038021159784415.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:00:11] [INFO ] Decomposing Gal with order
[2024-05-25 11:00:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:00:12] [INFO ] Removed a total of 4373 redundant transitions.
[2024-05-25 11:00:12] [INFO ] Flatten gal took : 708 ms
[2024-05-25 11:00:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 23 ms.
[2024-05-25 11:00:12] [INFO ] Time to serialize gal into /tmp/LTL5864834734132391582.gal : 3 ms
[2024-05-25 11:00:12] [INFO ] Time to serialize properties into /tmp/LTL10142803607918964267.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/LTL5864834734132391582.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10142803607918964267.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(G("(u1.CAPACITE>=3)"))))
Formula 0 simplified : XF!"(u1.CAPACITE>=3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17623141868943985230
[2024-05-25 11:00:27] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17623141868943985230
Running compilation step : cd /tmp/ltsmin17623141868943985230;'/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/ltsmin17623141868943985230;'/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/ltsmin17623141868943985230;'/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-PT-V50P50N20-LTLCardinality-06 finished in 96156 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)&&F(G(p1)))))'
[2024-05-25 11:00:31] [INFO ] Flatten gal took : 86 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15088188026547383478
[2024-05-25 11:00:31] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2024-05-25 11:00:31] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15088188026547383478
Running compilation step : cd /tmp/ltsmin15088188026547383478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' '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 11:00:31] [INFO ] Applying decomposition
[2024-05-25 11:00:31] [INFO ] Flatten gal took : 172 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/graph13792351067915859230.txt' '-o' '/tmp/graph13792351067915859230.bin' '-w' '/tmp/graph13792351067915859230.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13792351067915859230.bin' '-l' '-1' '-v' '-w' '/tmp/graph13792351067915859230.weights' '-q' '0' '-e' '0.001'
[2024-05-25 11:00:31] [INFO ] Decomposing Gal with order
[2024-05-25 11:00:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 11:00:32] [INFO ] Removed a total of 2546 redundant transitions.
[2024-05-25 11:00:32] [INFO ] Flatten gal took : 677 ms
[2024-05-25 11:00:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 533 labels/synchronizations in 27 ms.
[2024-05-25 11:00:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality1705924290995191242.gal : 19 ms
[2024-05-25 11:00:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality6344429146019886183.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/LTLCardinality1705924290995191242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6344429146019886183.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...297
Read 3 LTL properties
Checking formula 0 : !((X(X(F((G("(gu4.SUR_PONT_B<=gu4.ATTENTE_B)"))||(X(X(F(("(gu4.SUR_PONT_B>gu4.ATTENTE_B)")&&(X("(gu1.SORTI_A<=gu1.SUR_PONT_A)"))))))))...158
Formula 0 simplified : XXG(F!"(gu4.SUR_PONT_B<=gu4.ATTENTE_B)" & XXG(!"(gu4.SUR_PONT_B>gu4.ATTENTE_B)" | X!"(gu1.SORTI_A<=gu1.SUR_PONT_A)"))
Compilation finished in 7639 ms.
Running link step : cd /tmp/ltsmin15088188026547383478;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin15088188026547383478;'/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(X(<>(([]((LTLAPp0==true))||X(X(<>((!(LTLAPp0==true)&&X((LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin15088188026547383478;'/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(X(<>(([]((LTLAPp0==true))||X(X(<>((!(LTLAPp0==true)&&X((LTLAPp1==true))))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15088188026547383478;'/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([]((LTLAPp2==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 11:23:15] [INFO ] Flatten gal took : 172 ms
[2024-05-25 11:23:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality10766933485028755881.gal : 25 ms
[2024-05-25 11:23:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality5361750484453961470.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/LTLCardinality10766933485028755881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5361750484453961470.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 3 LTL properties
Checking formula 0 : !((X(X(F((G("(SUR_PONT_B<=ATTENTE_B)"))||(X(X(F(("(SUR_PONT_B>ATTENTE_B)")&&(X("(SORTI_A<=SUR_PONT_A)")))))))))))
Formula 0 simplified : XXG(F!"(SUR_PONT_B<=ATTENTE_B)" & XXG(!"(SUR_PONT_B>ATTENTE_B)" | X!"(SORTI_A<=SUR_PONT_A)"))
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin15088188026547383478;'/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([]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15088188026547383478;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>((LTLAPp3==true))&&<>([]((LTLAPp4==true)))))' '--buchi-type=spotba'
LTSmin run took 40889 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin15088188026547383478;'/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(X(<>(([]((LTLAPp0==true))||X(X(<>((!(LTLAPp0==true)&&X((LTLAPp1==true))))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-25 11:45:59] [INFO ] Flatten gal took : 462 ms
[2024-05-25 11:45:59] [INFO ] Input system was already deterministic with 2348 transitions.
[2024-05-25 11:45:59] [INFO ] Transformed 138 places.
[2024-05-25 11:46:00] [INFO ] Transformed 2348 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 11:46:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality7315759218948735604.gal : 12 ms
[2024-05-25 11:46:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality6603515391908334643.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/LTLCardinality7315759218948735604.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6603515391908334643.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(F((G("(SUR_PONT_B<=ATTENTE_B)"))||(X(X(F(("(SUR_PONT_B>ATTENTE_B)")&&(X("(SORTI_A<=SUR_PONT_A)")))))))))))
Formula 0 simplified : XXG(F!"(SUR_PONT_B<=ATTENTE_B)" & XXG(!"(SUR_PONT_B>ATTENTE_B)" | X!"(SORTI_A<=SUR_PONT_A)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 11972364 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16029376 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-PT-V50P50N20"
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-PT-V50P50N20, 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-171620414500162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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