fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251918000059
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for BridgeAndVehicles-COL-V20P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4933.571 1226837.00 4282220.00 1120.20 TTTTFFTFFTFTFTFT normal

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-165251918000059.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-V20P20N50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918000059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 8.0K Apr 29 23:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 23:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 29 23:15 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 3.9K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K 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 3.9K 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 41K 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-V20P20N50-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652545261753

Running Version 202205111006
[2022-05-14 16:21:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 16:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 16:21:03] [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 16:21:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-14 16:21:03] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 598 ms
[2022-05-14 16:21:03] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 16:21:03] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2022-05-14 16:21:03] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-14 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.2 ms
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 12 cols
[2022-05-14 16:21:04] [INFO ] Computed 4 place invariants in 10 ms
[2022-05-14 16:21:04] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-14 16:21:04] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-05-14 16:21:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-14 16:21:04] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-14 16:21:04] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-14 16:21:04] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 80 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 16:21:04] [INFO ] Flatten gal took : 15 ms
[2022-05-14 16:21:04] [INFO ] Flatten gal took : 2 ms
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2022-05-14 16:21:04] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 50 ms.
[2022-05-14 16:21:04] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Support contains 14 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 70 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-14 16:21:04] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-14 16:21:04] [INFO ] Computed 7 place invariants in 16 ms
[2022-05-14 16:21:05] [INFO ] Dead Transitions using invariants and state equation in 937 ms found 0 transitions.
[2022-05-14 16:21:05] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-14 16:21:05] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-14 16:21:06] [INFO ] Implicit Places using invariants in 262 ms returned []
[2022-05-14 16:21:06] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-14 16:21:06] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-14 16:21:06] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:21:07] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1460 ms to find 0 implicit places.
[2022-05-14 16:21:07] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-14 16:21:07] [INFO ] Computed 7 place invariants in 7 ms
[2022-05-14 16:21:07] [INFO ] Dead Transitions using invariants and state equation in 627 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/108 places, 2228/2228 transitions.
Support contains 14 out of 108 places after structural reductions.
[2022-05-14 16:21:08] [INFO ] Flatten gal took : 149 ms
[2022-05-14 16:21:08] [INFO ] Flatten gal took : 135 ms
[2022-05-14 16:21:08] [INFO ] Input system was already deterministic with 2228 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10018 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-14 16:21:09] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-14 16:21:09] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-14 16:21:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-14 16:21:09] [INFO ] After 30ms 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.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.32 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 35 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
[2022-05-14 16:21:09] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-14 16:21:09] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:21:09] [INFO ] Dead Transitions using invariants and state equation in 648 ms found 0 transitions.
[2022-05-14 16:21:09] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-14 16:21:09] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:21:10] [INFO ] Implicit Places using invariants in 280 ms returned []
[2022-05-14 16:21:10] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2022-05-14 16:21:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:21:11] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned [23, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1442 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 104/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 13 ms. Remains 104 /104 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 104/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT (ADD s47 s48) s45)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 25067 reset in 989 ms.
Product exploration explored 100000 steps with 24870 reset in 949 ms.
Computed a total of 47 stabilizing places and 84 stable transitions
Computed a total of 47 stabilizing places and 84 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2022-05-14 16:21:13] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 104 cols
[2022-05-14 16:21:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 16:21:14] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-14 16:21:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 16:21:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 16:21:14] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-14 16:21:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:21:14] [INFO ] [Nat]Added 102 Read/Feed constraints in 230 ms returned sat
[2022-05-14 16:21:15] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 197 transitions) in 176 ms.
[2022-05-14 16:21:15] [INFO ] Added : 26 causal constraints over 9 iterations in 1018 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 2228/2228 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 103 transition count 2227
Applied a total of 2 rules in 412 ms. Remains 103 /104 variables (removed 1) and now considering 2227/2228 (removed 1) transitions.
[2022-05-14 16:21:16] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:16] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:21:16] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
[2022-05-14 16:21:16] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:16] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-14 16:21:17] [INFO ] Implicit Places using invariants in 248 ms returned []
[2022-05-14 16:21:17] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:17] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:17] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:21:18] [INFO ] Implicit Places using invariants and state equation in 1137 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2022-05-14 16:21:18] [INFO ] Redundant transitions in 124 ms returned []
[2022-05-14 16:21:18] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:18] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:19] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/104 places, 2227/2228 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/104 places, 2227/2228 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2022-05-14 16:21:19] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:19] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-14 16:21:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-14 16:21:19] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-14 16:21:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-14 16:21:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-14 16:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-14 16:21:20] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-14 16:21:20] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:21:20] [INFO ] [Nat]Added 102 Read/Feed constraints in 283 ms returned sat
[2022-05-14 16:21:20] [INFO ] Computed and/alt/rep : 90/178/90 causal constraints (skipped 196 transitions) in 230 ms.
[2022-05-14 16:21:20] [INFO ] Added : 26 causal constraints over 6 iterations in 403 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25026 reset in 850 ms.
Product exploration explored 100000 steps with 24975 reset in 836 ms.
Built C files in :
/tmp/ltsmin10900544019815188838
[2022-05-14 16:21:22] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:21:22] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10900544019815188838
Running compilation step : cd /tmp/ltsmin10900544019815188838;'/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/ltsmin10900544019815188838;'/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/ltsmin10900544019815188838;'/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 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 2227/2227 transitions.
Applied a total of 0 rules in 248 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-14 16:21:25] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:26] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
[2022-05-14 16:21:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:26] [INFO ] Implicit Places using invariants in 237 ms returned []
[2022-05-14 16:21:26] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:26] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:21:27] [INFO ] Implicit Places using invariants and state equation in 1147 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
[2022-05-14 16:21:28] [INFO ] Redundant transitions in 105 ms returned []
[2022-05-14 16:21:28] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 103 cols
[2022-05-14 16:21:28] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:21:28] [INFO ] Dead Transitions using invariants and state equation in 600 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 2227/2227 transitions.
Built C files in :
/tmp/ltsmin16869237275499430389
[2022-05-14 16:21:28] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:21:28] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16869237275499430389
Running compilation step : cd /tmp/ltsmin16869237275499430389;'/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/ltsmin16869237275499430389;'/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/ltsmin16869237275499430389;'/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 16:21:32] [INFO ] Flatten gal took : 197 ms
[2022-05-14 16:21:32] [INFO ] Flatten gal took : 193 ms
[2022-05-14 16:21:32] [INFO ] Time to serialize gal into /tmp/LTL4877036955346180912.gal : 31 ms
[2022-05-14 16:21:32] [INFO ] Time to serialize properties into /tmp/LTL2846142201154964940.ltl : 61 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/LTL4877036955346180912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2846142201154964940.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/LTL4877036...266
Read 1 LTL properties
Checking formula 0 : !((X(F("((CONTROLEUR_0+CONTROLEUR_1)>SUR_PONT_B_0)"))))
Formula 0 simplified : !XF"((CONTROLEUR_0+CONTROLEUR_1)>SUR_PONT_B_0)"
Detected timeout of ITS tools.
[2022-05-14 16:21:47] [INFO ] Flatten gal took : 78 ms
[2022-05-14 16:21:47] [INFO ] Applying decomposition
[2022-05-14 16:21:47] [INFO ] Flatten gal took : 76 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/graph2761120180536094870.txt' '-o' '/tmp/graph2761120180536094870.bin' '-w' '/tmp/graph2761120180536094870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2761120180536094870.bin' '-l' '-1' '-v' '-w' '/tmp/graph2761120180536094870.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:21:48] [INFO ] Decomposing Gal with order
[2022-05-14 16:21:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:21:48] [INFO ] Removed a total of 6204 redundant transitions.
[2022-05-14 16:21:48] [INFO ] Flatten gal took : 639 ms
[2022-05-14 16:21:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 458 labels/synchronizations in 47 ms.
[2022-05-14 16:21:48] [INFO ] Time to serialize gal into /tmp/LTL9258635878817043633.gal : 2 ms
[2022-05-14 16:21:48] [INFO ] Time to serialize properties into /tmp/LTL17550858733833349175.ltl : 0 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/LTL9258635878817043633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17550858733833349175.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/LTL9258635...267
Read 1 LTL properties
Checking formula 0 : !((X(F("((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)>gu1.SUR_PONT_B_0)"))))
Formula 0 simplified : !XF"((gu1.CONTROLEUR_0+gu1.CONTROLEUR_1)>gu1.SUR_PONT_B_0)"
Reverse transition relation is NOT exact ! Due to transitions gi0.t45, gi0.t43, gi0.t42, gi0.t0, t44, t209, t1892, t2208_t21, t2217_t21, Intersection with...234
Computing Next relation with stutter on 40 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1368 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.7162,320756,1,0,322,1.61443e+06,132,176,4399,1.25999e+06,516
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-01 finished in 54051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(G(G(p0))))))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Applied a total of 3 rules in 224 ms. Remains 105 /108 variables (removed 3) and now considering 2227/2228 (removed 1) transitions.
[2022-05-14 16:22:03] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-14 16:22:03] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:22:04] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
[2022-05-14 16:22:04] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-14 16:22:04] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:22:04] [INFO ] Implicit Places using invariants in 311 ms returned []
[2022-05-14 16:22:04] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-14 16:22:04] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-14 16:22:04] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:22:05] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned [23, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1367 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 220 ms. Remains 103 /103 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 103/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 164 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-08 finished in 2622 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))&&F(p1)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 2227
Applied a total of 3 rules in 218 ms. Remains 106 /108 variables (removed 2) and now considering 2227/2228 (removed 1) transitions.
[2022-05-14 16:22:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 106 cols
[2022-05-14 16:22:06] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-14 16:22:06] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
[2022-05-14 16:22:06] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 106 cols
[2022-05-14 16:22:06] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-14 16:22:07] [INFO ] Implicit Places using invariants in 304 ms returned []
[2022-05-14 16:22:07] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 106 cols
[2022-05-14 16:22:07] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-14 16:22:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:22:07] [INFO ] Implicit Places using invariants and state equation in 910 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1228 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/108 places, 2227/2228 transitions.
Applied a total of 0 rules in 199 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 105/108 places, 2227/2228 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s24 s22), p0:(GT 1 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 685 reset in 979 ms.
Product exploration explored 100000 steps with 685 reset in 926 ms.
Computed a total of 48 stabilizing places and 83 stable transitions
Graph (complete) has 3143 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 48 stabilizing places and 83 stable transitions
Detected a total of 48/105 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 275 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 310 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 105 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 : 105/105 places, 2227/2227 transitions.
Applied a total of 0 rules in 200 ms. Remains 105 /105 variables (removed 0) and now considering 2227/2227 (removed 0) transitions.
[2022-05-14 16:22:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-14 16:22:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:22:11] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
[2022-05-14 16:22:11] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-14 16:22:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:22:12] [INFO ] Implicit Places using invariants in 304 ms returned []
[2022-05-14 16:22:12] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-14 16:22:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:22:12] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:22:13] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1237 ms to find 0 implicit places.
[2022-05-14 16:22:13] [INFO ] Redundant transitions in 52 ms returned []
[2022-05-14 16:22:13] [INFO ] Flow matrix only has 289 transitions (discarded 1938 similar events)
// Phase 1: matrix 289 rows 105 cols
[2022-05-14 16:22:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-14 16:22:13] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 105/105 places, 2227/2227 transitions.
Computed a total of 48 stabilizing places and 83 stable transitions
Graph (complete) has 3143 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 48 stabilizing places and 83 stable transitions
Detected a total of 48/105 stabilizing places and 83/2227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 685 reset in 917 ms.
Product exploration explored 100000 steps with 684 reset in 893 ms.
Built C files in :
/tmp/ltsmin16017052564270101983
[2022-05-14 16:22:16] [INFO ] Too many transitions (2227) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:22:16] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16017052564270101983
Running compilation step : cd /tmp/ltsmin16017052564270101983;'/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/ltsmin16017052564270101983;'/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/ltsmin16017052564270101983;'/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 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 2227/2227 transitions.
Graph (complete) has 3143 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 102 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 100 transition count 2224
Applied a total of 8 rules in 365 ms. Remains 100 /105 variables (removed 5) and now considering 2224/2227 (removed 3) transitions.
[2022-05-14 16:22:19] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 100 cols
[2022-05-14 16:22:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:22:19] [INFO ] Implicit Places using invariants in 321 ms returned []
[2022-05-14 16:22:19] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 100 cols
[2022-05-14 16:22:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:22:19] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:22:20] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
[2022-05-14 16:22:20] [INFO ] Redundant transitions in 47 ms returned []
[2022-05-14 16:22:20] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 100 cols
[2022-05-14 16:22:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:22:21] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/105 places, 2224/2227 transitions.
Finished structural reductions, in 1 iterations. Remains : 100/105 places, 2224/2227 transitions.
Built C files in :
/tmp/ltsmin9849922397785480828
[2022-05-14 16:22:21] [INFO ] Too many transitions (2224) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:22:21] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9849922397785480828
Running compilation step : cd /tmp/ltsmin9849922397785480828;'/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/ltsmin9849922397785480828;'/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/ltsmin9849922397785480828;'/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 16:22:24] [INFO ] Flatten gal took : 77 ms
[2022-05-14 16:22:24] [INFO ] Flatten gal took : 75 ms
[2022-05-14 16:22:24] [INFO ] Time to serialize gal into /tmp/LTL8888261615471167389.gal : 13 ms
[2022-05-14 16:22:24] [INFO ] Time to serialize properties into /tmp/LTL17281139626726990551.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/LTL8888261615471167389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17281139626726990551.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/LTL8888261...267
Read 1 LTL properties
Checking formula 0 : !(((F(X(G("(ATTENTE_B_0<1)"))))&&(F("(SUR_PONT_A_0<=SORTI_A_0)"))))
Formula 0 simplified : !(FXG"(ATTENTE_B_0<1)" & F"(SUR_PONT_A_0<=SORTI_A_0)")
Detected timeout of ITS tools.
[2022-05-14 16:22:39] [INFO ] Flatten gal took : 70 ms
[2022-05-14 16:22:39] [INFO ] Applying decomposition
[2022-05-14 16:22:39] [INFO ] Flatten gal took : 69 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/graph13987338678896965120.txt' '-o' '/tmp/graph13987338678896965120.bin' '-w' '/tmp/graph13987338678896965120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13987338678896965120.bin' '-l' '-1' '-v' '-w' '/tmp/graph13987338678896965120.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:22:40] [INFO ] Decomposing Gal with order
[2022-05-14 16:22:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:22:40] [INFO ] Removed a total of 2113 redundant transitions.
[2022-05-14 16:22:40] [INFO ] Flatten gal took : 363 ms
[2022-05-14 16:22:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 196 labels/synchronizations in 17 ms.
[2022-05-14 16:22:40] [INFO ] Time to serialize gal into /tmp/LTL16601910052723318455.gal : 6 ms
[2022-05-14 16:22:40] [INFO ] Time to serialize properties into /tmp/LTL729611037834297632.ltl : 0 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/LTL16601910052723318455.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL729611037834297632.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/LTL1660191...266
Read 1 LTL properties
Checking formula 0 : !(((F(X(G("(gi1.gu1.ATTENTE_B_0<1)"))))&&(F("(gu0.SUR_PONT_A_0<=gu0.SORTI_A_0)"))))
Formula 0 simplified : !(FXG"(gi1.gu1.ATTENTE_B_0<1)" & F"(gu0.SUR_PONT_A_0<=gu0.SORTI_A_0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5286975860758274213
[2022-05-14 16:22:55] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5286975860758274213
Running compilation step : cd /tmp/ltsmin5286975860758274213;'/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/ltsmin5286975860758274213;'/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/ltsmin5286975860758274213;'/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-V20P20N50-LTLCardinality-09 finished in 52766 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 101 transition count 2224
Applied a total of 10 rules in 266 ms. Remains 101 /108 variables (removed 7) and now considering 2224/2228 (removed 4) transitions.
[2022-05-14 16:22:58] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2022-05-14 16:22:58] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 16:22:59] [INFO ] Implicit Places using invariants in 311 ms returned []
[2022-05-14 16:22:59] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 101 cols
[2022-05-14 16:22:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:22:59] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:23:00] [INFO ] Implicit Places using invariants and state equation in 774 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1091 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/108 places, 2224/2228 transitions.
Applied a total of 0 rules in 225 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 99/108 places, 2224/2228 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 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:(LEQ 1 s43), p0:(GT 1 (ADD s44 s45))], 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 1598 reset in 535 ms.
Product exploration explored 100000 steps with 1597 reset in 518 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Detected a total of 44/99 stabilizing places and 82/2224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 270 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 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 36 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 379 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 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 212 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2022-05-14 16:23:02] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-14 16:23:02] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 16:23:02] [INFO ] Implicit Places using invariants in 243 ms returned []
[2022-05-14 16:23:02] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-14 16:23:02] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:23:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:23:03] [INFO ] Implicit Places using invariants and state equation in 785 ms returned []
Implicit Place search using SMT with State Equation took 1030 ms to find 0 implicit places.
[2022-05-14 16:23:03] [INFO ] Redundant transitions in 50 ms returned []
[2022-05-14 16:23:03] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-14 16:23:03] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 16:23:04] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 2224/2224 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Detected a total of 44/99 stabilizing places and 82/2224 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 239 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 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 42 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 363 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 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1596 reset in 539 ms.
Product exploration explored 100000 steps with 1603 reset in 528 ms.
Built C files in :
/tmp/ltsmin16299117129864929706
[2022-05-14 16:23:06] [INFO ] Too many transitions (2224) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:23:06] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16299117129864929706
Running compilation step : cd /tmp/ltsmin16299117129864929706;'/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/ltsmin16299117129864929706;'/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/ltsmin16299117129864929706;'/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 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 2224/2224 transitions.
Applied a total of 0 rules in 220 ms. Remains 99 /99 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
[2022-05-14 16:23:09] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-14 16:23:09] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-14 16:23:09] [INFO ] Implicit Places using invariants in 257 ms returned []
[2022-05-14 16:23:09] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-14 16:23:09] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:23:09] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:23:10] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2022-05-14 16:23:10] [INFO ] Redundant transitions in 51 ms returned []
[2022-05-14 16:23:10] [INFO ] Flow matrix only has 286 transitions (discarded 1938 similar events)
// Phase 1: matrix 286 rows 99 cols
[2022-05-14 16:23:10] [INFO ] Computed 4 place invariants in 6 ms
[2022-05-14 16:23:11] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 99/99 places, 2224/2224 transitions.
Built C files in :
/tmp/ltsmin11409738098303611420
[2022-05-14 16:23:11] [INFO ] Too many transitions (2224) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:23:11] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11409738098303611420
Running compilation step : cd /tmp/ltsmin11409738098303611420;'/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/ltsmin11409738098303611420;'/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/ltsmin11409738098303611420;'/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 16:23:14] [INFO ] Flatten gal took : 70 ms
[2022-05-14 16:23:14] [INFO ] Flatten gal took : 69 ms
[2022-05-14 16:23:14] [INFO ] Time to serialize gal into /tmp/LTL16657528413397454265.gal : 9 ms
[2022-05-14 16:23:14] [INFO ] Time to serialize properties into /tmp/LTL4442893903294109412.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/LTL16657528413397454265.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4442893903294109412.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/LTL1665752...267
Read 1 LTL properties
Checking formula 0 : !((G(F(("((CONTROLEUR_0+CONTROLEUR_1)<1)")||(G("(ROUTE_B_0>=1)"))))))
Formula 0 simplified : !GF("((CONTROLEUR_0+CONTROLEUR_1)<1)" | G"(ROUTE_B_0>=1)")
Detected timeout of ITS tools.
[2022-05-14 16:23:29] [INFO ] Flatten gal took : 67 ms
[2022-05-14 16:23:29] [INFO ] Applying decomposition
[2022-05-14 16:23:29] [INFO ] Flatten gal took : 66 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/graph1573702116109899867.txt' '-o' '/tmp/graph1573702116109899867.bin' '-w' '/tmp/graph1573702116109899867.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1573702116109899867.bin' '-l' '-1' '-v' '-w' '/tmp/graph1573702116109899867.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:23:29] [INFO ] Decomposing Gal with order
[2022-05-14 16:23:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:23:30] [INFO ] Removed a total of 6319 redundant transitions.
[2022-05-14 16:23:30] [INFO ] Flatten gal took : 476 ms
[2022-05-14 16:23:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 357 labels/synchronizations in 31 ms.
[2022-05-14 16:23:30] [INFO ] Time to serialize gal into /tmp/LTL5496107243143531214.gal : 1 ms
[2022-05-14 16:23:30] [INFO ] Time to serialize properties into /tmp/LTL9249415544685312527.ltl : 0 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/LTL5496107243143531214.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9249415544685312527.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/LTL5496107...266
Read 1 LTL properties
Checking formula 0 : !((G(F(("((gu0.CONTROLEUR_0+gu0.CONTROLEUR_1)<1)")||(G("(gi1.gu2.ROUTE_B_0>=1)"))))))
Formula 0 simplified : !GF("((gu0.CONTROLEUR_0+gu0.CONTROLEUR_1)<1)" | G"(gi1.gu2.ROUTE_B_0>=1)")
Reverse transition relation is NOT exact ! Due to transitions gi1.t45, gi1.t0, t37_t21, t2208_t21, t2212_t21, t1233_t42, t825_t43, Intersection with reach...228
Computing Next relation with stutter on 40 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12648026969650586649
[2022-05-14 16:23:45] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12648026969650586649
Running compilation step : cd /tmp/ltsmin12648026969650586649;'/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/ltsmin12648026969650586649;'/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/ltsmin12648026969650586649;'/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-V20P20N50-LTLCardinality-10 finished in 49820 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)&&p1) U !X(p2)))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 11 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
[2022-05-14 16:23:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-14 16:23:48] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-14 16:23:49] [INFO ] Dead Transitions using invariants and state equation in 639 ms found 0 transitions.
[2022-05-14 16:23:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-14 16:23:49] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-14 16:23:49] [INFO ] Implicit Places using invariants in 304 ms returned []
[2022-05-14 16:23:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2022-05-14 16:23:49] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-14 16:23:49] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:23:51] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1897 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 21 ms. Remains 107 /107 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 107/108 places, 2228/2228 transitions.
Stuttering acceptance computed with spot in 179 ms :[p2, p2, p2, true, (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s52 s53) s49), p0:(LEQ s24 1), p2:(LEQ s22 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-COL-V20P20N50-LTLCardinality-12 finished in 2778 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(G(p0))))))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 3190 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 105 transition count 2227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 103 transition count 2226
Applied a total of 6 rules in 270 ms. Remains 103 /108 variables (removed 5) and now considering 2226/2228 (removed 2) transitions.
[2022-05-14 16:23:51] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2022-05-14 16:23:51] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 16:23:51] [INFO ] Implicit Places using invariants in 310 ms returned []
[2022-05-14 16:23:51] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 103 cols
[2022-05-14 16:23:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-14 16:23:51] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:23:53] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned [22, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1511 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/108 places, 2226/2228 transitions.
Applied a total of 0 rules in 273 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 101/108 places, 2226/2228 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s99 s100))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 793 reset in 833 ms.
Product exploration explored 100000 steps with 794 reset in 842 ms.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=41 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 258 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2022-05-14 16:23:55] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-14 16:23:55] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 16:23:56] [INFO ] Implicit Places using invariants in 317 ms returned []
[2022-05-14 16:23:56] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-14 16:23:56] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:23:56] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:23:57] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2022-05-14 16:23:57] [INFO ] Redundant transitions in 54 ms returned []
[2022-05-14 16:23:57] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-14 16:23:57] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-14 16:23:57] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2226/2226 transitions.
Computed a total of 44 stabilizing places and 82 stable transitions
Computed a total of 44 stabilizing places and 82 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 793 reset in 808 ms.
Product exploration explored 100000 steps with 793 reset in 808 ms.
Built C files in :
/tmp/ltsmin15654509629267876171
[2022-05-14 16:23:59] [INFO ] Too many transitions (2226) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:23:59] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15654509629267876171
Running compilation step : cd /tmp/ltsmin15654509629267876171;'/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/ltsmin15654509629267876171;'/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/ltsmin15654509629267876171;'/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 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 2226/2226 transitions.
Applied a total of 0 rules in 258 ms. Remains 101 /101 variables (removed 0) and now considering 2226/2226 (removed 0) transitions.
[2022-05-14 16:24:03] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-14 16:24:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:24:03] [INFO ] Implicit Places using invariants in 308 ms returned []
[2022-05-14 16:24:03] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-14 16:24:03] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:24:03] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-14 16:24:04] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
[2022-05-14 16:24:04] [INFO ] Redundant transitions in 48 ms returned []
[2022-05-14 16:24:04] [INFO ] Flow matrix only has 288 transitions (discarded 1938 similar events)
// Phase 1: matrix 288 rows 101 cols
[2022-05-14 16:24:04] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-14 16:24:05] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 101/101 places, 2226/2226 transitions.
Built C files in :
/tmp/ltsmin15070859138296839991
[2022-05-14 16:24:05] [INFO ] Too many transitions (2226) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:24:05] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15070859138296839991
Running compilation step : cd /tmp/ltsmin15070859138296839991;'/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/ltsmin15070859138296839991;'/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/ltsmin15070859138296839991;'/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 16:24:08] [INFO ] Flatten gal took : 117 ms
[2022-05-14 16:24:08] [INFO ] Flatten gal took : 65 ms
[2022-05-14 16:24:08] [INFO ] Time to serialize gal into /tmp/LTL14801459195378918891.gal : 16 ms
[2022-05-14 16:24:08] [INFO ] Time to serialize properties into /tmp/LTL16007759449766877180.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/LTL14801459195378918891.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16007759449766877180.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/LTL1480145...268
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(G("((VIDANGE_0+VIDANGE_1)<1)")))))))
Formula 0 simplified : !XGXFG"((VIDANGE_0+VIDANGE_1)<1)"
Detected timeout of ITS tools.
[2022-05-14 16:24:23] [INFO ] Flatten gal took : 66 ms
[2022-05-14 16:24:23] [INFO ] Applying decomposition
[2022-05-14 16:24:23] [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/graph16521629179017684061.txt' '-o' '/tmp/graph16521629179017684061.bin' '-w' '/tmp/graph16521629179017684061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16521629179017684061.bin' '-l' '-1' '-v' '-w' '/tmp/graph16521629179017684061.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:24:23] [INFO ] Decomposing Gal with order
[2022-05-14 16:24:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:24:27] [INFO ] Removed a total of 2040 redundant transitions.
[2022-05-14 16:24:27] [INFO ] Flatten gal took : 3236 ms
[2022-05-14 16:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 2042 labels/synchronizations in 65 ms.
[2022-05-14 16:24:27] [INFO ] Time to serialize gal into /tmp/LTL17490457815761161497.gal : 8 ms
[2022-05-14 16:24:27] [INFO ] Time to serialize properties into /tmp/LTL7175094503302997005.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/LTL17490457815761161497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7175094503302997005.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/LTL1749045...267
Read 1 LTL properties
Checking formula 0 : !((X(G(X(F(G("((gu1.VIDANGE_0+gu1.VIDANGE_1)<1)")))))))
Formula 0 simplified : !XGXFG"((gu1.VIDANGE_0+gu1.VIDANGE_1)<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15071034005076790638
[2022-05-14 16:24:42] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15071034005076790638
Running compilation step : cd /tmp/ltsmin15071034005076790638;'/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/ltsmin15071034005076790638;'/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/ltsmin15071034005076790638;'/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-V20P20N50-LTLCardinality-13 finished in 54204 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(G(p0)))&&F(p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(G(p0))))))'
[2022-05-14 16:24:45] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1585099740087919104
[2022-05-14 16:24:45] [INFO ] Too many transitions (2228) to apply POR reductions. Disabling POR matrices.
[2022-05-14 16:24:45] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1585099740087919104
Running compilation step : cd /tmp/ltsmin1585099740087919104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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 16:24:45] [INFO ] Applying decomposition
[2022-05-14 16:24:46] [INFO ] Flatten gal took : 64 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/graph2021633223557110103.txt' '-o' '/tmp/graph2021633223557110103.bin' '-w' '/tmp/graph2021633223557110103.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2021633223557110103.bin' '-l' '-1' '-v' '-w' '/tmp/graph2021633223557110103.weights' '-q' '0' '-e' '0.001'
[2022-05-14 16:24:46] [INFO ] Decomposing Gal with order
[2022-05-14 16:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-14 16:24:50] [INFO ] Removed a total of 4235 redundant transitions.
[2022-05-14 16:24:50] [INFO ] Flatten gal took : 4638 ms
[2022-05-14 16:24:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2180 labels/synchronizations in 77 ms.
[2022-05-14 16:24:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality5946243100493491014.gal : 7 ms
[2022-05-14 16:24:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality14275239237443856622.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/LTLCardinality5946243100493491014.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14275239237443856622.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/LTLCardina...289
Read 3 LTL properties
Compilation finished in 5359 ms.
Running link step : cd /tmp/ltsmin1585099740087919104;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Checking formula 0 : !(((F(X(G("(gu2.ATTENTE_B_0<1)"))))&&(F("(gu0.SUR_PONT_A_0<=gu0.SORTI_A_0)"))))
Formula 0 simplified : !(FXG"(gu2.ATTENTE_B_0<1)" & F"(gu0.SUR_PONT_A_0<=gu0.SORTI_A_0)")
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin1585099740087919104;'/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))))&&<>((LTLAPp1==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gu2.t0, gu2.t44, gu2.t45, t21, t42, t43, t770, t1591, Intersection with reachable at each st...213
Computing Next relation with stutter on 40 deadlock states
LTSmin run took 571808 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1585099740087919104;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp2==true)||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 9830 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin1585099740087919104;'/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([](X(<>([]((LTLAPp4==true))))))' '--buchi-type=spotba'
LTSmin run took 415381 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 1225558 ms.

BK_STOP 1652546488590

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-V20P20N50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N50.tgz
mv BridgeAndVehicles-COL-V20P20N50 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;