Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918000076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-COL-V50P20N20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918000076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 8.3K Apr 29 23:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 29 23:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 29 23:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 23:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 42K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-COL-V50P20N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652550113592

Running Version 202205111006
[2022-05-14 17:41:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 17:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 17:41:54] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-14 17:41:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 17:41:55] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 600 ms
[2022-05-14 17:41:55] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 138 PT places and 218878.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2022-05-14 17:41:55] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 8 ms.
[2022-05-14 17:41:55] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Remains 4 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Finished random walk after 116 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=9 )
[2022-05-14 17:41:55] [INFO ] Flatten gal took : 15 ms
[2022-05-14 17:41:55] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 51)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 51) 51) 51)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-14 17:41:55] [INFO ] Unfolded HLPN to a Petri net with 138 places and 2348 transitions 18090 arcs in 96 ms.
[2022-05-14 17:41:55] [INFO ] Unfolded 14 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 135 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 40 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 17:41:56] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:41:56] [INFO ] Computed 5 place invariants in 19 ms
[2022-05-14 17:41:57] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
[2022-05-14 17:41:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:41:57] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:41:57] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-05-14 17:41:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:41:57] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:41:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:41:57] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2022-05-14 17:41:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:41:57] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:41:58] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/138 places, 2348/2348 transitions.
Support contains 135 out of 136 places after structural reductions.
[2022-05-14 17:41:58] [INFO ] Flatten gal took : 202 ms
[2022-05-14 17:41:58] [INFO ] Flatten gal took : 178 ms
[2022-05-14 17:41:59] [INFO ] Input system was already deterministic with 2348 transitions.
Finished random walk after 837 steps, including 1 resets, run visited all 15 properties in 219 ms. (steps per millisecond=3 )
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 109 stabilizing places and 204 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0))) U G(((F(p2) U X(p2))||p1))))'
Support contains 55 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2346
Applied a total of 5 rules in 460 ms. Remains 133 /136 variables (removed 3) and now considering 2346/2348 (removed 2) transitions.
[2022-05-14 17:42:00] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 133 cols
[2022-05-14 17:42:00] [INFO ] Computed 4 place invariants in 17 ms
[2022-05-14 17:42:01] [INFO ] Implicit Places using invariants in 295 ms returned []
[2022-05-14 17:42:01] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 133 cols
[2022-05-14 17:42:01] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 17:42:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:42:02] [INFO ] Implicit Places using invariants and state equation in 960 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1274 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/136 places, 2346/2348 transitions.
Applied a total of 0 rules in 229 ms. Remains 131 /131 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 131/136 places, 2346/2348 transitions.
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s107 1) (GEQ s128 1)) (AND (GEQ s106 1) (GEQ s128 1))), p0:(OR (AND (GEQ s61 1) (GEQ s103 1)) (AND (GEQ s100 1) (GEQ s103 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 28493 reset in 779 ms.
Product exploration explored 100000 steps with 28501 reset in 695 ms.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Detected a total of 104/131 stabilizing places and 202/2346 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 517 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 31 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 7) seen :5
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-14 17:42:05] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:05] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-14 17:42:05] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2))), (F p1)]
Knowledge based reduction with 14 factoid took 635 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
[2022-05-14 17:42:06] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:06] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 17:42:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 17:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:42:07] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2022-05-14 17:42:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:42:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 17:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:42:08] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-05-14 17:42:08] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:42:08] [INFO ] [Nat]Added 42 Read/Feed constraints in 284 ms returned sat
[2022-05-14 17:42:08] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 110 ms.
[2022-05-14 17:42:08] [INFO ] Added : 20 causal constraints over 4 iterations in 372 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2346/2346 transitions.
Applied a total of 0 rules in 219 ms. Remains 131 /131 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
[2022-05-14 17:42:09] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:09] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-14 17:42:09] [INFO ] Implicit Places using invariants in 264 ms returned []
[2022-05-14 17:42:09] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:09] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 17:42:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:42:09] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 975 ms to find 0 implicit places.
[2022-05-14 17:42:10] [INFO ] Redundant transitions in 131 ms returned []
[2022-05-14 17:42:10] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:10] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 17:42:10] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 2346/2346 transitions.
Computed a total of 104 stabilizing places and 202 stable transitions
Computed a total of 104 stabilizing places and 202 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Finished random walk after 118 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p2)]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
[2022-05-14 17:42:11] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:11] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 17:42:12] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 17:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 17:42:12] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2022-05-14 17:42:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 17:42:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-14 17:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 17:42:12] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-14 17:42:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:42:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 282 ms returned sat
[2022-05-14 17:42:13] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 165 transitions) in 77 ms.
[2022-05-14 17:42:13] [INFO ] Added : 20 causal constraints over 4 iterations in 284 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 804 reset in 438 ms.
Product exploration explored 100000 steps with 797 reset in 415 ms.
Built C files in :
/tmp/ltsmin10638190350000432811
[2022-05-14 17:42:14] [INFO ] Too many transitions (2346) to apply POR reductions. Disabling POR matrices.
[2022-05-14 17:42:14] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10638190350000432811
Running compilation step : cd /tmp/ltsmin10638190350000432811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10638190350000432811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10638190350000432811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 2346/2346 transitions.
Applied a total of 0 rules in 253 ms. Remains 131 /131 variables (removed 0) and now considering 2346/2346 (removed 0) transitions.
[2022-05-14 17:42:17] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:17] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:42:18] [INFO ] Implicit Places using invariants in 324 ms returned []
[2022-05-14 17:42:18] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:18] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:42:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:42:19] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2022-05-14 17:42:19] [INFO ] Redundant transitions in 113 ms returned []
[2022-05-14 17:42:19] [INFO ] Flow matrix only has 288 transitions (discarded 2058 similar events)
// Phase 1: matrix 288 rows 131 cols
[2022-05-14 17:42:19] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 17:42:19] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 2346/2346 transitions.
Built C files in :
/tmp/ltsmin10139664932021877692
[2022-05-14 17:42:19] [INFO ] Too many transitions (2346) to apply POR reductions. Disabling POR matrices.
[2022-05-14 17:42:19] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10139664932021877692
Running compilation step : cd /tmp/ltsmin10139664932021877692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10139664932021877692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10139664932021877692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 17:42:23] [INFO ] Flatten gal took : 92 ms
[2022-05-14 17:42:23] [INFO ] Flatten gal took : 118 ms
[2022-05-14 17:42:23] [INFO ] Time to serialize gal into /tmp/LTL7685626941699209955.gal : 26 ms
[2022-05-14 17:42:23] [INFO ] Time to serialize properties into /tmp/LTL13365972385497804866.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7685626941699209955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13365972385497804866.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7685626...267
Read 1 LTL properties
Checking formula 0 : !(((G(X(F("((((((((NB_ATTENTE_B_9>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_48>=1)&&(ROUTE_B_0>=1)))||(((NB_ATTENTE_B_29>=1)&&(ROUTE_B_0>=1...2404
Formula 0 simplified : !(GXF"((((((((NB_ATTENTE_B_9>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_48>=1)&&(ROUTE_B_0>=1)))||(((NB_ATTENTE_B_29>=1)&&(ROUTE_B_0>=1))|...2386
Detected timeout of ITS tools.
[2022-05-14 17:42:38] [INFO ] Flatten gal took : 77 ms
[2022-05-14 17:42:38] [INFO ] Applying decomposition
[2022-05-14 17:42:38] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14678655532723261243.txt' '-o' '/tmp/graph14678655532723261243.bin' '-w' '/tmp/graph14678655532723261243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14678655532723261243.bin' '-l' '-1' '-v' '-w' '/tmp/graph14678655532723261243.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:42:39] [INFO ] Decomposing Gal with order
[2022-05-14 17:42:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:42:39] [INFO ] Removed a total of 4235 redundant transitions.
[2022-05-14 17:42:40] [INFO ] Flatten gal took : 915 ms
[2022-05-14 17:42:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 29 ms.
[2022-05-14 17:42:40] [INFO ] Time to serialize gal into /tmp/LTL10619817760020594371.gal : 2 ms
[2022-05-14 17:42:40] [INFO ] Time to serialize properties into /tmp/LTL11997206721678741101.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10619817760020594371.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11997206721678741101.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1061981...247
Read 1 LTL properties
Checking formula 0 : !(((G(X(F("((((((((i0.u2.NB_ATTENTE_B_9>=1)&&(i0.u2.ROUTE_B_0>=1))||((i0.u2.NB_ATTENTE_B_48>=1)&&(i0.u2.ROUTE_B_0>=1)))||(((i0.u2.NB_A...3076
Formula 0 simplified : !(GXF"((((((((i0.u2.NB_ATTENTE_B_9>=1)&&(i0.u2.ROUTE_B_0>=1))||((i0.u2.NB_ATTENTE_B_48>=1)&&(i0.u2.ROUTE_B_0>=1)))||(((i0.u2.NB_ATTE...3058
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17954737938821506080
[2022-05-14 17:42:55] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17954737938821506080
Running compilation step : cd /tmp/ltsmin17954737938821506080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17954737938821506080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17954737938821506080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-01 finished in 57802 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G(p0))&&(X(p1)||(!(p3 U p4)&&p2))))))'
Support contains 129 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 17 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 17:42:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:42:58] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:42:58] [INFO ] Dead Transitions using invariants and state equation in 762 ms found 0 transitions.
[2022-05-14 17:42:58] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:42:58] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-14 17:42:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2022-05-14 17:42:59] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:42:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:42:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:42:59] [INFO ] Implicit Places using invariants and state equation in 719 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 851 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) p4)), (AND p0 (NOT p1) p4), (AND p0 (NOT p1) p4)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND p4 p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p3 (NOT p4) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}], [{ cond=(AND p4 p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p4) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p4 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p4)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s0 20) (LT s133 1)) (OR (LT s0 20) (LT s132 1))), p2:(AND (OR (LT s0 20) (LT s133 1)) (OR (LT s0 20) (LT s132 1))), p4:(OR (AND (GEQ s0 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2874 reset in 1158 ms.
Product exploration explored 100000 steps with 2977 reset in 1162 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 : [(AND p0 p2 (NOT p4) (NOT p3) p1), (X (NOT (OR (AND (NOT p2) p0) (AND p4 p0)))), (X (NOT (AND p4 p0 (NOT p1)))), (X (NOT (AND p2 p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p4 p0 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p4 p0))), (X (X (NOT (AND p4 p0)))), (X (X (OR (AND (NOT p2) p0) (AND p4 p0)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p4 p0))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 693 ms. Reduced automaton from 4 states, 9 edges and 5 AP to 4 states, 9 edges and 5 AP.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) p4)), (AND p0 (NOT p1) p4), (AND p0 (NOT p1) p4)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 373 ms. (steps per millisecond=26 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 1064 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 683 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-14 17:43:05] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:05] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:43:07] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 17:43:07] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-14 17:43:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 17:43:07] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p4) (NOT p3) p1), (X (NOT (OR (AND (NOT p2) p0) (AND p4 p0)))), (X (NOT (AND p4 p0 (NOT p1)))), (X (NOT (AND p2 p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p4 p0 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p1))))), (X (X p0)), (G (NOT (AND p4 p0 (NOT p1)))), (G (NOT (AND (NOT p4) p3 (NOT p1))))]
False Knowledge obtained : [(X (X (AND p4 p0))), (X (X (NOT (AND p4 p0)))), (X (X (OR (AND (NOT p2) p0) (AND p4 p0)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p4 p0))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND p4 p0)), (F (NOT p0)), (F (AND (NOT p4) p2 p0 p3)), (F (OR (AND p4 p0) (AND (NOT p2) p0))), (F (AND (NOT p4) p3))]
Knowledge based reduction with 14 factoid took 988 ms. Reduced automaton from 4 states, 9 edges and 5 AP to 2 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND (NOT p1) p0 (NOT p4) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND (NOT p1) p0 (NOT p4) (NOT p2))]
Support contains 127 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 15 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:43:08] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:08] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:43:09] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
[2022-05-14 17:43:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:09] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:43:09] [INFO ] Implicit Places using invariants in 108 ms returned []
[2022-05-14 17:43:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:09] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:43:09] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:43:09] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2022-05-14 17:43:09] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:09] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-14 17:43:10] [INFO ] Dead Transitions using invariants and state equation in 702 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p4) p2), (X (NOT (AND (NOT p1) (NOT p4) p0))), (X (NOT (OR (AND (NOT p1) p4) (NOT p0)))), (X (NOT (OR (AND p4 p0) (AND p0 (NOT p2))))), (X (OR (AND p1 p0) (AND (NOT p4) p0))), (X (X (NOT (OR (AND (NOT p1) p4) (NOT p0))))), (X (X (OR (AND p1 p0) (AND (NOT p4) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p4) p0))), (X (X (NOT (AND (NOT p1) (NOT p4) p0)))), (X (X (OR (AND p4 p0) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p4 p0) (AND p0 (NOT p2))))))]
Knowledge based reduction with 7 factoid took 349 ms. Reduced automaton from 2 states, 4 edges and 4 AP to 2 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND p0 (NOT p1) (NOT p4) (NOT p2))]
Finished random walk after 394 steps, including 0 resets, run visited all 4 properties in 42 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p1 p0 (NOT p4) p2), (X (NOT (AND (NOT p1) (NOT p4) p0))), (X (NOT (OR (AND (NOT p1) p4) (NOT p0)))), (X (NOT (OR (AND p4 p0) (AND p0 (NOT p2))))), (X (OR (AND p1 p0) (AND (NOT p4) p0))), (X (X (NOT (OR (AND (NOT p1) p4) (NOT p0))))), (X (X (OR (AND p1 p0) (AND (NOT p4) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p4) p0))), (X (X (NOT (AND (NOT p1) (NOT p4) p0)))), (X (X (OR (AND p4 p0) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p4 p0) (AND p0 (NOT p2)))))), (F (AND p0 (NOT p1) (NOT p4))), (F (NOT (OR (AND p0 p1) (AND p0 (NOT p4))))), (F (OR (AND p0 p4) (AND p0 (NOT p2)))), (F (OR (NOT p0) (AND (NOT p1) p4)))]
Knowledge based reduction with 7 factoid took 423 ms. Reduced automaton from 2 states, 4 edges and 4 AP to 2 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND p0 (NOT p1) (NOT p4) (NOT p2))]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND p0 (NOT p1) (NOT p4) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND p0 (NOT p1) (NOT p4) (NOT p2))]
Product exploration explored 100000 steps with 2682 reset in 9223 ms.
Product exploration explored 100000 steps with 2791 reset in 9257 ms.
Built C files in :
/tmp/ltsmin1833509281453172640
[2022-05-14 17:43:30] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1833509281453172640
Running compilation step : cd /tmp/ltsmin1833509281453172640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1833509281453172640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1833509281453172640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 127 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 13 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:43:33] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:43:36] [INFO ] Dead Transitions using invariants and state equation in 3130 ms found 0 transitions.
[2022-05-14 17:43:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:43:36] [INFO ] Implicit Places using invariants in 86 ms returned []
[2022-05-14 17:43:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:43:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:43:36] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2022-05-14 17:43:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:43:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:43:37] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin18117505059565042028
[2022-05-14 17:43:37] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18117505059565042028
Running compilation step : cd /tmp/ltsmin18117505059565042028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18117505059565042028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18117505059565042028;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 17:43:41] [INFO ] Flatten gal took : 170 ms
[2022-05-14 17:43:41] [INFO ] Flatten gal took : 170 ms
[2022-05-14 17:43:41] [INFO ] Time to serialize gal into /tmp/LTL5901339165270705549.gal : 11 ms
[2022-05-14 17:43:41] [INFO ] Time to serialize properties into /tmp/LTL17019401883688835144.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5901339165270705549.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17019401883688835144.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5901339...267
Read 1 LTL properties
Checking formula 0 : !((F(G((X(G("(((CAPACITE_0<20)||(VIDANGE_1<1))&&((CAPACITE_0<20)||(VIDANGE_0<1)))")))&&((X("((((((((((((((NB_ATTENTE_A_0<1)||(NB_ATTEN...91979
Formula 0 simplified : !FG(XG"(((CAPACITE_0<20)||(VIDANGE_1<1))&&((CAPACITE_0<20)||(VIDANGE_0<1)))" & (X"((((((((((((((NB_ATTENTE_A_0<1)||(NB_ATTENTE_B_37<...91959
Detected timeout of ITS tools.
[2022-05-14 17:43:56] [INFO ] Flatten gal took : 96 ms
[2022-05-14 17:43:56] [INFO ] Applying decomposition
[2022-05-14 17:43:56] [INFO ] Flatten gal took : 102 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18159082055197744484.txt' '-o' '/tmp/graph18159082055197744484.bin' '-w' '/tmp/graph18159082055197744484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18159082055197744484.bin' '-l' '-1' '-v' '-w' '/tmp/graph18159082055197744484.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:43:56] [INFO ] Decomposing Gal with order
[2022-05-14 17:43:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:43:57] [INFO ] Removed a total of 4472 redundant transitions.
[2022-05-14 17:43:57] [INFO ] Flatten gal took : 583 ms
[2022-05-14 17:43:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 425 labels/synchronizations in 23 ms.
[2022-05-14 17:43:57] [INFO ] Time to serialize gal into /tmp/LTL3872879023835181539.gal : 2 ms
[2022-05-14 17:43:57] [INFO ] Time to serialize properties into /tmp/LTL12215813384429272886.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3872879023835181539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12215813384429272886.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3872879...246
Read 1 LTL properties
Checking formula 0 : !((F(G((X(G("(((i0.u0.CAPACITE_0<20)||(u4.VIDANGE_1<1))&&((i0.u0.CAPACITE_0<20)||(i1.u2.VIDANGE_0<1)))")))&&((X("((((((((((((((u4.NB_A...108845
Formula 0 simplified : !FG(XG"(((i0.u0.CAPACITE_0<20)||(u4.VIDANGE_1<1))&&((i0.u0.CAPACITE_0<20)||(i1.u2.VIDANGE_0<1)))" & (X"((((((((((((((u4.NB_ATTENTE_A...108825
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16752369889008087357
[2022-05-14 17:44:12] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16752369889008087357
Running compilation step : cd /tmp/ltsmin16752369889008087357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16752369889008087357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16752369889008087357;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-02 finished in 77608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&(G(p1)||G(p2))))'
Support contains 105 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 10 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 17:44:15] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:44:15] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 17:44:16] [INFO ] Dead Transitions using invariants and state equation in 776 ms found 0 transitions.
[2022-05-14 17:44:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:44:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:44:16] [INFO ] Implicit Places using invariants in 176 ms returned []
[2022-05-14 17:44:16] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:44:16] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:44:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:44:17] [INFO ] Implicit Places using invariants and state equation in 573 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 759 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s52 1)) (AND (GEQ s22 1) (GEQ s52 1)) (AND (GEQ s41 1) (GEQ s52 1)) (AND (GEQ s32 1) (GEQ s52 1)) (AND (GEQ s51 1) (GEQ s52 1)...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 184 steps with 0 reset in 5 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-03 finished in 1771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||X(G(F(G(F(G(p1)))))))))'
Support contains 53 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 224 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 17:44:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:44:17] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:44:18] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
[2022-05-14 17:44:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:44:18] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:44:18] [INFO ] Implicit Places using invariants in 272 ms returned []
[2022-05-14 17:44:18] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:44:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:44:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:44:19] [INFO ] Implicit Places using invariants and state equation in 701 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 981 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 285 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s2 1) (GEQ s52 1)) (AND (GEQ s22 1) (GEQ s52 1)) (AND (GEQ s41 1) (GEQ s52 1)) (AND (GEQ s32 1) (GEQ s52 1)) (AND (GEQ s51 1) (GEQ s52 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 528 reset in 768 ms.
Product exploration explored 100000 steps with 532 reset in 672 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 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 426 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 156 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 53 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 191 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:44:22] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:44:22] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:44:23] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
[2022-05-14 17:44:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:44:23] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:44:23] [INFO ] Implicit Places using invariants in 272 ms returned []
[2022-05-14 17:44:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:44:23] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:44:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:44:24] [INFO ] Implicit Places using invariants and state equation in 826 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2022-05-14 17:44:24] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-14 17:44:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:44:24] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:44:24] [INFO ] Dead Transitions using invariants and state equation in 646 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 283 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 141 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=70 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 530 reset in 697 ms.
Product exploration explored 100000 steps with 527 reset in 734 ms.
Built C files in :
/tmp/ltsmin1925638685174163004
[2022-05-14 17:44:27] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2022-05-14 17:44:27] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1925638685174163004
Running compilation step : cd /tmp/ltsmin1925638685174163004;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1925638685174163004;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1925638685174163004;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 53 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 231 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:44:30] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:44:30] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 17:44:31] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
[2022-05-14 17:44:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:44:31] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:44:31] [INFO ] Implicit Places using invariants in 277 ms returned []
[2022-05-14 17:44:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:44:31] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-14 17:44:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:44:32] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2022-05-14 17:44:32] [INFO ] Redundant transitions in 58 ms returned []
[2022-05-14 17:44:32] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:44:32] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 17:44:32] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin6700979885281421142
[2022-05-14 17:44:32] [INFO ] Too many transitions (2347) to apply POR reductions. Disabling POR matrices.
[2022-05-14 17:44:33] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6700979885281421142
Running compilation step : cd /tmp/ltsmin6700979885281421142;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6700979885281421142;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6700979885281421142;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 17:44:36] [INFO ] Flatten gal took : 123 ms
[2022-05-14 17:44:36] [INFO ] Flatten gal took : 67 ms
[2022-05-14 17:44:36] [INFO ] Time to serialize gal into /tmp/LTL85657949879443577.gal : 10 ms
[2022-05-14 17:44:36] [INFO ] Time to serialize properties into /tmp/LTL13431298048813349274.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL85657949879443577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13431298048813349274.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8565794...265
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(SUR_PONT_A_0>=1)")))||(X(G(F(G(F(G("((((((((NB_ATTENTE_A_1>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_21>=1)&&(ROUTE_A_0>=1)))||...2208
Formula 0 simplified : !F(GF"(SUR_PONT_A_0>=1)" | XGFGFG"((((((((NB_ATTENTE_A_1>=1)&&(ROUTE_A_0>=1))||((NB_ATTENTE_A_21>=1)&&(ROUTE_A_0>=1)))||(((NB_ATTENT...2187
Detected timeout of ITS tools.
[2022-05-14 17:44:51] [INFO ] Flatten gal took : 67 ms
[2022-05-14 17:44:51] [INFO ] Applying decomposition
[2022-05-14 17:44:51] [INFO ] Flatten gal took : 68 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2210527797160926332.txt' '-o' '/tmp/graph2210527797160926332.bin' '-w' '/tmp/graph2210527797160926332.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2210527797160926332.bin' '-l' '-1' '-v' '-w' '/tmp/graph2210527797160926332.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:44:51] [INFO ] Decomposing Gal with order
[2022-05-14 17:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:44:52] [INFO ] Removed a total of 4373 redundant transitions.
[2022-05-14 17:44:52] [INFO ] Flatten gal took : 418 ms
[2022-05-14 17:44:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 18 ms.
[2022-05-14 17:44:52] [INFO ] Time to serialize gal into /tmp/LTL1427628878782637298.gal : 1 ms
[2022-05-14 17:44:52] [INFO ] Time to serialize properties into /tmp/LTL17870307082985170619.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1427628878782637298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17870307082985170619.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1427628...246
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(u0.SUR_PONT_A_0>=1)")))||(X(G(F(G(F(G("((((((((i2.u2.NB_ATTENTE_A_1>=1)&&(i2.u2.ROUTE_A_0>=1))||((i2.u2.NB_ATTENTE_A_21>=1...2820
Formula 0 simplified : !F(GF"(u0.SUR_PONT_A_0>=1)" | XGFGFG"((((((((i2.u2.NB_ATTENTE_A_1>=1)&&(i2.u2.ROUTE_A_0>=1))||((i2.u2.NB_ATTENTE_A_21>=1)&&(i2.u2.RO...2799
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15712474720573837898
[2022-05-14 17:45:07] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15712474720573837898
Running compilation step : cd /tmp/ltsmin15712474720573837898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15712474720573837898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15712474720573837898;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-04 finished in 52768 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p2)||p1)&&p0)))'
Support contains 56 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 8 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2022-05-14 17:45:10] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:45:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:45:11] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
[2022-05-14 17:45:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:45:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:45:11] [INFO ] Implicit Places using invariants in 260 ms returned []
[2022-05-14 17:45:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:45:11] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:45:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:45:11] [INFO ] Implicit Places using invariants and state equation in 715 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 983 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 135/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(GEQ s54 1), p0:(AND (OR (LT s0 1) (LT s51 1) (LT s53 1) (LT s108 1)) (OR (LT s0 1) (LT s27 1) (LT s53 1) (LT s108 1)) (OR (LT s0 1) (LT s3 1) (LT s53 ...], 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 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-05 finished in 1938 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||p1)))'
Support contains 75 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 265 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 17:45:12] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:45:12] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-14 17:45:13] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
[2022-05-14 17:45:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:45:13] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-14 17:45:13] [INFO ] Implicit Places using invariants in 173 ms returned []
[2022-05-14 17:45:13] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:45:13] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:45:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:45:13] [INFO ] Implicit Places using invariants and state equation in 523 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 702 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 253 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s109 1) (LT s122 1)) (OR (LT s109 1) (LT s121 1)) (OR (LT s109 1) (LT s120 1)) (OR (LT s109 1) (LT s119 1)) (OR (LT s109 1) (LT s118 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25185 reset in 1370 ms.
Product exploration explored 100000 steps with 24999 reset in 1448 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 : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 287 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 17:45:17] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:45:17] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:45:17] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 17:45:17] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-06 finished in 5707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 73 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2344
Applied a total of 9 rules in 327 ms. Remains 131 /136 variables (removed 5) and now considering 2344/2348 (removed 4) transitions.
[2022-05-14 17:45:18] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2022-05-14 17:45:18] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 17:45:18] [INFO ] Implicit Places using invariants in 148 ms returned []
[2022-05-14 17:45:18] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2022-05-14 17:45:18] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 17:45:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:45:18] [INFO ] Implicit Places using invariants and state equation in 511 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 663 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/136 places, 2344/2348 transitions.
Applied a total of 0 rules in 273 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 129/136 places, 2344/2348 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s44 1) (GEQ s52 1) (GEQ s105 1) (GEQ s116 1)) (AND (GEQ s27 1) (GEQ s52 1) (GEQ s105 1) (GEQ s122 1)) (AND (GEQ s6 1) (GEQ s52 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 307 steps with 0 reset in 17 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-07 finished in 1350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!G(!(X(p1)||p0))) U X(p2)))'
Support contains 74 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 15 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 17:45:19] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:45:19] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:45:20] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
[2022-05-14 17:45:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:45:20] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:45:20] [INFO ] Implicit Places using invariants in 193 ms returned []
[2022-05-14 17:45:20] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:45:20] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:45:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:45:20] [INFO ] Implicit Places using invariants and state equation in 724 ms returned [53, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 921 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/136 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 2 iterations. Remains : 133/136 places, 2347/2348 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s108 1) (GEQ s121 1)) (AND (GEQ s108 1) (GEQ s120 1)) (AND (GEQ s108 1) (GEQ s119 1)) (AND (GEQ s108 1) (GEQ s118 1)) (AND (GEQ s108 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 38435 reset in 864 ms.
Product exploration explored 100000 steps with 38350 reset in 901 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/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 3 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 137 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 3 factoid took 359 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 74 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 15 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:45:23] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:23] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:45:24] [INFO ] Dead Transitions using invariants and state equation in 628 ms found 0 transitions.
[2022-05-14 17:45:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:45:24] [INFO ] Implicit Places using invariants in 188 ms returned []
[2022-05-14 17:45:24] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:24] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:45:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:45:25] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2022-05-14 17:45:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:25] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:45:25] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 3 factoid took 264 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 115 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 181 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=60 )
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (F (NOT p2)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 3 factoid took 291 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 3 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 38274 reset in 811 ms.
Product exploration explored 100000 steps with 38421 reset in 853 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 74 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 2347
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 333 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:45:29] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:29] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:45:29] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
[2022-05-14 17:45:29] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-14 17:45:29] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:29] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:45:30] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/133 places, 2347/2347 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Product exploration explored 100000 steps with 38270 reset in 2190 ms.
Product exploration explored 100000 steps with 38302 reset in 2183 ms.
Built C files in :
/tmp/ltsmin12595056638986595246
[2022-05-14 17:45:34] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12595056638986595246
Running compilation step : cd /tmp/ltsmin12595056638986595246;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12595056638986595246;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12595056638986595246;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 74 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 2347/2347 transitions.
Applied a total of 0 rules in 16 ms. Remains 133 /133 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:45:37] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:37] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:45:38] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
[2022-05-14 17:45:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:45:38] [INFO ] Implicit Places using invariants in 193 ms returned []
[2022-05-14 17:45:38] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:38] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:45:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:45:39] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2022-05-14 17:45:39] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 133 cols
[2022-05-14 17:45:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:45:39] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin5033037348714530884
[2022-05-14 17:45:40] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5033037348714530884
Running compilation step : cd /tmp/ltsmin5033037348714530884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5033037348714530884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5033037348714530884;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 17:45:43] [INFO ] Flatten gal took : 81 ms
[2022-05-14 17:45:43] [INFO ] Flatten gal took : 73 ms
[2022-05-14 17:45:43] [INFO ] Time to serialize gal into /tmp/LTL13611886905794416412.gal : 8 ms
[2022-05-14 17:45:43] [INFO ] Time to serialize properties into /tmp/LTL16211857419019623312.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13611886905794416412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16211857419019623312.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1361188...268
Read 1 LTL properties
Checking formula 0 : !(((X(!(G(!(((((((X("((((((((NB_ATTENTE_B_9>=1)&&(ROUTE_B_0>=1))||((NB_ATTENTE_B_48>=1)&&(ROUTE_B_0>=1)))||(((NB_ATTENTE_B_29>=1)&&(RO...5041
Formula 0 simplified : !(X!G!("((((((CHOIX_0>=1)&&(COMPTEUR_0>=1))||((CHOIX_1>=1)&&(COMPTEUR_17>=1)))||(((CHOIX_1>=1)&&(COMPTEUR_12>=1))||((CHOIX_1>=1)&&(C...5011
Detected timeout of ITS tools.
[2022-05-14 17:45:58] [INFO ] Flatten gal took : 69 ms
[2022-05-14 17:45:58] [INFO ] Applying decomposition
[2022-05-14 17:45:58] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13939351354391062616.txt' '-o' '/tmp/graph13939351354391062616.bin' '-w' '/tmp/graph13939351354391062616.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13939351354391062616.bin' '-l' '-1' '-v' '-w' '/tmp/graph13939351354391062616.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:45:58] [INFO ] Decomposing Gal with order
[2022-05-14 17:45:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:45:59] [INFO ] Removed a total of 4373 redundant transitions.
[2022-05-14 17:45:59] [INFO ] Flatten gal took : 478 ms
[2022-05-14 17:45:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 327 labels/synchronizations in 17 ms.
[2022-05-14 17:45:59] [INFO ] Time to serialize gal into /tmp/LTL7598867705923194743.gal : 2 ms
[2022-05-14 17:45:59] [INFO ] Time to serialize properties into /tmp/LTL14362785009831658582.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7598867705923194743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14362785009831658582.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7598867...246
Read 1 LTL properties
Checking formula 0 : !(((X(!(G(!(((((((X("((((((((u3.NB_ATTENTE_B_9>=1)&&(u3.ROUTE_B_0>=1))||((u3.NB_ATTENTE_B_48>=1)&&(u3.ROUTE_B_0>=1)))||(((u3.NB_ATTENT...6070
Formula 0 simplified : !(X!G!("((((((u0.CHOIX_0>=1)&&(i2.u1.COMPTEUR_0>=1))||((u0.CHOIX_1>=1)&&(i2.u1.COMPTEUR_17>=1)))||(((u0.CHOIX_1>=1)&&(i2.u1.COMPTEUR...6040
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5741607502943762645
[2022-05-14 17:46:14] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5741607502943762645
Running compilation step : cd /tmp/ltsmin5741607502943762645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5741607502943762645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5741607502943762645;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-08 finished in 58012 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(p0))))))'
Support contains 52 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2346
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2344
Applied a total of 9 rules in 245 ms. Remains 131 /136 variables (removed 5) and now considering 2344/2348 (removed 4) transitions.
[2022-05-14 17:46:17] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2022-05-14 17:46:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:46:17] [INFO ] Implicit Places using invariants in 253 ms returned []
[2022-05-14 17:46:17] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2022-05-14 17:46:17] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 17:46:17] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:46:18] [INFO ] Implicit Places using invariants and state equation in 804 ms returned [52, 104]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1067 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/136 places, 2344/2348 transitions.
Applied a total of 0 rules in 169 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 129/136 places, 2344/2348 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s61 1) (GEQ s103 1)) (AND (GEQ s100 1) (GEQ s103 1)) (AND (GEQ s81 1) (GEQ s103 1)) (AND (GEQ s90 1) (GEQ s103 1)) (AND (GEQ s101 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 309 steps with 0 reset in 4 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-09 finished in 1572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (X(p1) U p0)))'
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.
[2022-05-14 17:46:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:46:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:46:19] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2022-05-14 17:46:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:46:19] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 17:46:19] [INFO ] Implicit Places using invariants in 345 ms returned []
[2022-05-14 17:46:19] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:46:19] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:46:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:46:21] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1529 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 12 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, p0, (AND p0 p1)]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s110 1) (GEQ s131 1)) (AND (GEQ s109 1) (GEQ s131 1))), p1:(GEQ s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 813 ms.
Product exploration explored 100000 steps with 50000 reset in 789 ms.
Computed a total of 107 stabilizing places and 204 stable transitions
Computed a total of 107 stabilizing places and 204 stable transitions
Detected a total of 107/134 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) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-13 finished in 4076 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)&&!p1)) U !p0))'
Support contains 74 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.
[2022-05-14 17:46:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:46:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:46:23] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
[2022-05-14 17:46:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:46:23] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:46:23] [INFO ] Implicit Places using invariants in 158 ms returned []
[2022-05-14 17:46:23] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2022-05-14 17:46:23] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:46:23] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:46:24] [INFO ] Implicit Places using invariants and state equation in 617 ms returned [53, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 782 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/136 places, 2348/2348 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), p0, true, true]
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(LT s53 1), p1:(OR (AND (GEQ s1 1) (GEQ s91 1) (GEQ s107 1) (GEQ s116 1)) (AND (GEQ s1 1) (GEQ s103 1) (GEQ s107 1) (GEQ s117 1)) (AND (GEQ s1 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-14 finished in 1631 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0))) U G(((F(p2) U X(p2))||p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(G(p0))&&(X(p1)||(!(p3 U p4)&&p2))))))'
Found a SL insensitive property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-02
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) p4)), (AND p0 (NOT p1) p4), (AND p0 (NOT p1) p4)]
Support contains 129 out of 136 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Applied a total of 2 rules in 32 ms. Remains 135 /136 variables (removed 1) and now considering 2347/2348 (removed 1) transitions.
[2022-05-14 17:46:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:46:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:46:25] [INFO ] Dead Transitions using invariants and state equation in 656 ms found 0 transitions.
[2022-05-14 17:46:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:46:25] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:46:25] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-14 17:46:25] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 135 cols
[2022-05-14 17:46:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:46:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:46:26] [INFO ] Implicit Places using invariants and state equation in 295 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 417 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 134/136 places, 2347/2348 transitions.
Applied a total of 0 rules in 19 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/136 places, 2347/2348 transitions.
Running random walk in product with property : BridgeAndVehicles-COL-V50P20N20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND p4 p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p3 (NOT p4) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}], [{ cond=(AND p4 p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p3 (NOT p4) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p4 p0), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p4)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s0 20) (LT s133 1)) (OR (LT s0 20) (LT s132 1))), p2:(AND (OR (LT s0 20) (LT s133 1)) (OR (LT s0 20) (LT s132 1))), p4:(OR (AND (GEQ s0 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2946 reset in 1177 ms.
Product exploration explored 100000 steps with 2819 reset in 1100 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 : [(AND p0 p2 (NOT p4) (NOT p3) p1), (X (NOT (OR (AND (NOT p2) p0) (AND p4 p0)))), (X (NOT (AND p4 p0 (NOT p1)))), (X (NOT (AND p2 p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p4 p0 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p4 p0))), (X (X (NOT (AND p4 p0)))), (X (X (OR (AND (NOT p2) p0) (AND p4 p0)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p4 p0))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 12 factoid took 807 ms. Reduced automaton from 4 states, 9 edges and 5 AP to 4 states, 9 edges and 5 AP.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) p4)), (AND p0 (NOT p1) p4), (AND p0 (NOT p1) p4)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 1099 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 959 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2022-05-14 17:46:31] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:46:31] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:46:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 17:46:33] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-14 17:46:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 17:46:33] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p4) (NOT p3) p1), (X (NOT (OR (AND (NOT p2) p0) (AND p4 p0)))), (X (NOT (AND p4 p0 (NOT p1)))), (X (NOT (AND p2 p3 (NOT p4) p0))), (X (NOT (AND p3 (NOT p4) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p4 p0 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p4) p0)))), (X (X (NOT (AND p3 (NOT p4) (NOT p1))))), (X (X p0)), (G (NOT (AND p4 p0 (NOT p1)))), (G (NOT (AND (NOT p4) p3 (NOT p1))))]
False Knowledge obtained : [(X (X (AND p4 p0))), (X (X (NOT (AND p4 p0)))), (X (X (OR (AND (NOT p2) p0) (AND p4 p0)))), (X (X (NOT (OR (AND (NOT p2) p0) (AND p4 p0))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND p4 p0)), (F (NOT p0)), (F (AND (NOT p4) p2 p0 p3)), (F (OR (AND p4 p0) (AND (NOT p2) p0))), (F (AND (NOT p4) p3))]
Knowledge based reduction with 14 factoid took 1032 ms. Reduced automaton from 4 states, 9 edges and 5 AP to 2 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND (NOT p1) p0 (NOT p4) (NOT p2))]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND (NOT p1) p0 (NOT p4) (NOT p2))]
Support contains 127 out of 134 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 12 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:46:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:46:35] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:46:35] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
[2022-05-14 17:46:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:46:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:46:35] [INFO ] Implicit Places using invariants in 88 ms returned []
[2022-05-14 17:46:35] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:46:35] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 17:46:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:46:36] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2022-05-14 17:46:36] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:46:36] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:46:36] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2347/2347 transitions.
Computed a total of 107 stabilizing places and 203 stable transitions
Computed a total of 107 stabilizing places and 203 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p4) p2), (X (NOT (AND (NOT p1) (NOT p4) p0))), (X (NOT (OR (AND (NOT p1) p4) (NOT p0)))), (X (NOT (OR (AND p4 p0) (AND p0 (NOT p2))))), (X (OR (AND p1 p0) (AND (NOT p4) p0))), (X (X (NOT (OR (AND (NOT p1) p4) (NOT p0))))), (X (X (OR (AND p1 p0) (AND (NOT p4) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p4) p0))), (X (X (NOT (AND (NOT p1) (NOT p4) p0)))), (X (X (OR (AND p4 p0) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p4 p0) (AND p0 (NOT p2))))))]
Knowledge based reduction with 7 factoid took 594 ms. Reduced automaton from 2 states, 4 edges and 4 AP to 2 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND p0 (NOT p1) (NOT p4) (NOT p2))]
Finished random walk after 392 steps, including 0 resets, run visited all 4 properties in 40 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p1 p0 (NOT p4) p2), (X (NOT (AND (NOT p1) (NOT p4) p0))), (X (NOT (OR (AND (NOT p1) p4) (NOT p0)))), (X (NOT (OR (AND p4 p0) (AND p0 (NOT p2))))), (X (OR (AND p1 p0) (AND (NOT p4) p0))), (X (X (NOT (OR (AND (NOT p1) p4) (NOT p0))))), (X (X (OR (AND p1 p0) (AND (NOT p4) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p4) p0))), (X (X (NOT (AND (NOT p1) (NOT p4) p0)))), (X (X (OR (AND p4 p0) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p4 p0) (AND p0 (NOT p2)))))), (F (AND p0 (NOT p1) (NOT p4))), (F (NOT (OR (AND p0 p1) (AND p0 (NOT p4))))), (F (OR (AND p0 p4) (AND p0 (NOT p2)))), (F (OR (NOT p0) (AND (NOT p1) p4)))]
Knowledge based reduction with 7 factoid took 482 ms. Reduced automaton from 2 states, 4 edges and 4 AP to 2 states, 4 edges and 4 AP.
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND p0 (NOT p1) (NOT p4) (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND p0 (NOT p1) (NOT p4) (NOT p2))]
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p4)), (AND p0 (NOT p1) (NOT p4) (NOT p2))]
Product exploration explored 100000 steps with 2680 reset in 9588 ms.
Product exploration explored 100000 steps with 2814 reset in 9668 ms.
Built C files in :
/tmp/ltsmin6774604582440619017
[2022-05-14 17:46:57] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6774604582440619017
Running compilation step : cd /tmp/ltsmin6774604582440619017;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6774604582440619017;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6774604582440619017;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 127 out of 134 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 134/134 places, 2347/2347 transitions.
Applied a total of 0 rules in 14 ms. Remains 134 /134 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
[2022-05-14 17:47:00] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:47:00] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-14 17:47:01] [INFO ] Dead Transitions using invariants and state equation in 636 ms found 0 transitions.
[2022-05-14 17:47:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:47:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:47:01] [INFO ] Implicit Places using invariants in 109 ms returned []
[2022-05-14 17:47:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:47:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:47:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-14 17:47:01] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2022-05-14 17:47:01] [INFO ] Flow matrix only has 289 transitions (discarded 2058 similar events)
// Phase 1: matrix 289 rows 134 cols
[2022-05-14 17:47:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 17:47:02] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/134 places, 2347/2347 transitions.
Built C files in :
/tmp/ltsmin17217369026427231156
[2022-05-14 17:47:02] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17217369026427231156
Running compilation step : cd /tmp/ltsmin17217369026427231156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17217369026427231156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17217369026427231156;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-14 17:47:05] [INFO ] Flatten gal took : 85 ms
[2022-05-14 17:47:05] [INFO ] Flatten gal took : 84 ms
[2022-05-14 17:47:05] [INFO ] Time to serialize gal into /tmp/LTL2865529629227433509.gal : 9 ms
[2022-05-14 17:47:05] [INFO ] Time to serialize properties into /tmp/LTL1882927542125425525.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2865529629227433509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1882927542125425525.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2865529...266
Read 1 LTL properties
Checking formula 0 : !((F(G((X(G("(((CAPACITE_0<20)||(VIDANGE_1<1))&&((CAPACITE_0<20)||(VIDANGE_0<1)))")))&&((X("((((((((((((((NB_ATTENTE_A_0<1)||(NB_ATTEN...91979
Formula 0 simplified : !FG(XG"(((CAPACITE_0<20)||(VIDANGE_1<1))&&((CAPACITE_0<20)||(VIDANGE_0<1)))" & (X"((((((((((((((NB_ATTENTE_A_0<1)||(NB_ATTENTE_B_37<...91959
Detected timeout of ITS tools.
[2022-05-14 17:47:20] [INFO ] Flatten gal took : 86 ms
[2022-05-14 17:47:20] [INFO ] Applying decomposition
[2022-05-14 17:47:21] [INFO ] Flatten gal took : 85 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8647689396059949521.txt' '-o' '/tmp/graph8647689396059949521.bin' '-w' '/tmp/graph8647689396059949521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8647689396059949521.bin' '-l' '-1' '-v' '-w' '/tmp/graph8647689396059949521.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:47:21] [INFO ] Decomposing Gal with order
[2022-05-14 17:47:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:47:21] [INFO ] Removed a total of 4472 redundant transitions.
[2022-05-14 17:47:21] [INFO ] Flatten gal took : 587 ms
[2022-05-14 17:47:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 475 labels/synchronizations in 18 ms.
[2022-05-14 17:47:21] [INFO ] Time to serialize gal into /tmp/LTL2067831208656068255.gal : 2 ms
[2022-05-14 17:47:22] [INFO ] Time to serialize properties into /tmp/LTL4131980145965706452.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2067831208656068255.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4131980145965706452.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2067831...245
Read 1 LTL properties
Checking formula 0 : !((F(G((X(G("(((u2.CAPACITE_0<20)||(i0.u4.VIDANGE_1<1))&&((u2.CAPACITE_0<20)||(i2.u3.VIDANGE_0<1)))")))&&((X("((((((((((((((i0.u4.NB_A...118283
Formula 0 simplified : !FG(XG"(((u2.CAPACITE_0<20)||(i0.u4.VIDANGE_1<1))&&((u2.CAPACITE_0<20)||(i2.u3.VIDANGE_0<1)))" & (X"((((((((((((((i0.u4.NB_ATTENTE_A...118263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12485186530512907447
[2022-05-14 17:47:37] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12485186530512907447
Running compilation step : cd /tmp/ltsmin12485186530512907447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12485186530512907447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12485186530512907447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property BridgeAndVehicles-COL-V50P20N20-LTLFireability-02 finished in 75380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||X(G(F(G(F(G(p1)))))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!G(!(X(p1)||p0))) U X(p2)))'
[2022-05-14 17:47:40] [INFO ] Flatten gal took : 92 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9797480338541766775
[2022-05-14 17:47:40] [INFO ] Too many transitions (2348) to apply POR reductions. Disabling POR matrices.
[2022-05-14 17:47:40] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9797480338541766775
Running compilation step : cd /tmp/ltsmin9797480338541766775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-14 17:47:40] [INFO ] Applying decomposition
[2022-05-14 17:47:40] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8036279270182439971.txt' '-o' '/tmp/graph8036279270182439971.bin' '-w' '/tmp/graph8036279270182439971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8036279270182439971.bin' '-l' '-1' '-v' '-w' '/tmp/graph8036279270182439971.weights' '-q' '0' '-e' '0.001'
[2022-05-14 17:47:40] [INFO ] Decomposing Gal with order
[2022-05-14 17:47:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 17:47:41] [INFO ] Removed a total of 4571 redundant transitions.
[2022-05-14 17:47:41] [INFO ] Flatten gal took : 705 ms
[2022-05-14 17:47:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 573 labels/synchronizations in 23 ms.
[2022-05-14 17:47:41] [INFO ] Time to serialize gal into /tmp/LTLFireability6183573988426880114.gal : 2 ms
[2022-05-14 17:47:41] [INFO ] Time to serialize properties into /tmp/LTLFireability6966738243006383150.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6183573988426880114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6966738243006383150.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 4 LTL properties
Checking formula 0 : !(((G(X(F("((((((((i1.u5.NB_ATTENTE_B_9>=1)&&(i0.u2.ROUTE_B_0>=1))||((i1.u5.NB_ATTENTE_B_48>=1)&&(i0.u2.ROUTE_B_0>=1)))||(((i1.u5.NB_A...3088
Formula 0 simplified : !(GXF"((((((((i1.u5.NB_ATTENTE_B_9>=1)&&(i0.u2.ROUTE_B_0>=1))||((i1.u5.NB_ATTENTE_B_48>=1)&&(i0.u2.ROUTE_B_0>=1)))||(((i1.u5.NB_ATTE...3070
Compilation finished in 5743 ms.
Running link step : cd /tmp/ltsmin9797480338541766775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin9797480338541766775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X(<>((LTLAPp0==true)))) U [](((<>((LTLAPp2==true)) U X((LTLAPp2==true)))||(LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 306855 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9797480338541766775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X([]((LTLAPp3==true)))&&(X((LTLAPp4==true))||(!((LTLAPp2==true) U (LTLAPp6==true))&&(LTLAPp5==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9797480338541766775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X([]((LTLAPp3==true)))&&(X((LTLAPp4==true))||(!((LTLAPp2==true) U (LTLAPp6==true))&&(LTLAPp5==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9797480338541766775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp7==true)))||X([](<>([](<>([]((LTLAPp8==true)))))))))' '--buchi-type=spotba'
LTSmin run took 445 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9797480338541766775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X()||(LTLAPp9==true)))) U X((LTLAPp10==true)))' '--buchi-type=spotba'
LTSmin run took 933 ms.
FORMULA BridgeAndVehicles-COL-V50P20N20-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin9797480338541766775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X([]((LTLAPp3==true)))&&(X((LTLAPp4==true))||(!((LTLAPp2==true) U (LTLAPp6==true))&&(LTLAPp5==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-14 18:09:36] [INFO ] Applying decomposition
[2022-05-14 18:09:37] [INFO ] Flatten gal took : 198 ms
[2022-05-14 18:09:37] [INFO ] Decomposing Gal with order
[2022-05-14 18:09:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 18:09:37] [INFO ] Removed a total of 13270 redundant transitions.
[2022-05-14 18:09:37] [INFO ] Flatten gal took : 523 ms
[2022-05-14 18:09:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 60 ms.
[2022-05-14 18:09:38] [INFO ] Time to serialize gal into /tmp/LTLFireability14213208642653016569.gal : 36 ms
[2022-05-14 18:09:38] [INFO ] Time to serialize properties into /tmp/LTLFireability12860205937042351568.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability14213208642653016569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12860205937042351568.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((F(G((X(G("(((CAPACITE.CAPACITE_0<20)||(sens1.VIDANGE_1<1))&&((CAPACITE.CAPACITE_0<20)||(sens0.VIDANGE_0<1)))")))&&((X("((((((((((((...133075
Formula 0 simplified : !FG(XG"(((CAPACITE.CAPACITE_0<20)||(sens1.VIDANGE_1<1))&&((CAPACITE.CAPACITE_0<20)||(sens0.VIDANGE_0<1)))" & (X"((((((((((((((voitur...133055
Detected timeout of ITS tools.
[2022-05-14 18:31:34] [INFO ] Flatten gal took : 260 ms
[2022-05-14 18:31:34] [INFO ] Input system was already deterministic with 2348 transitions.
[2022-05-14 18:31:34] [INFO ] Transformed 136 places.
[2022-05-14 18:31:34] [INFO ] Transformed 2348 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-14 18:31:34] [INFO ] Time to serialize gal into /tmp/LTLFireability10440680330489943332.gal : 16 ms
[2022-05-14 18:31:34] [INFO ] Time to serialize properties into /tmp/LTLFireability3384635199052433746.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10440680330489943332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3384635199052433746.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((X(G("(((CAPACITE_0<20)||(VIDANGE_1<1))&&((CAPACITE_0<20)||(VIDANGE_0<1)))")))&&((X("((((((((((((((NB_ATTENTE_A_0<1)||(NB_ATTEN...91979
Formula 0 simplified : !FG(XG"(((CAPACITE_0<20)||(VIDANGE_1<1))&&((CAPACITE_0<20)||(VIDANGE_0<1)))" & (X"((((((((((((((NB_ATTENTE_A_0<1)||(NB_ATTENTE_B_37<...91959

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V50P20N20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-COL-V50P20N20, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918000076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V50P20N20.tgz
mv BridgeAndVehicles-COL-V50P20N20 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;