About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P10N10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6823.004 | 2897340.00 | 10955560.00 | 2408.80 | TTFFFTTTTTFFFTTT | 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-165251918200179.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-PT-V20P10N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200179
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K Apr 29 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 73K Apr 29 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 320K Apr 29 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 43K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 137K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K May 9 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 434K 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-PT-V20P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652579226704
Running Version 202205111006
[2022-05-15 01:47:07] [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-15 01:47:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 01:47:08] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-15 01:47:08] [INFO ] Transformed 68 places.
[2022-05-15 01:47:08] [INFO ] Transformed 548 transitions.
[2022-05-15 01:47:08] [INFO ] Parsed PT model containing 68 places and 548 transitions in 214 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:47:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 01:47:08] [INFO ] Computed 7 place invariants in 20 ms
[2022-05-15 01:47:08] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2022-05-15 01:47:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 01:47:08] [INFO ] Computed 7 place invariants in 7 ms
[2022-05-15 01:47:08] [INFO ] Implicit Places using invariants in 111 ms returned []
[2022-05-15 01:47:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 01:47:08] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-15 01:47:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:47:08] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2022-05-15 01:47:08] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 01:47:08] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 01:47:09] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 548/548 transitions.
Support contains 14 out of 68 places after structural reductions.
[2022-05-15 01:47:09] [INFO ] Flatten gal took : 67 ms
[2022-05-15 01:47:09] [INFO ] Flatten gal took : 42 ms
[2022-05-15 01:47:09] [INFO ] Input system was already deterministic with 548 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
[2022-05-15 01:47:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-15 01:47:10] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-15 01:47:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-15 01:47:10] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.13 ms
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(X(p1))))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 548
Applied a total of 1 rules in 8 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:47:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:47:10] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 01:47:10] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
[2022-05-15 01:47:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:47:10] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 01:47:10] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-15 01:47:10] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:47:10] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:47:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:47:11] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/68 places, 548/548 transitions.
Applied a total of 0 rules in 10 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 66/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(AND (LEQ 3 s24) (LEQ s23 s22)), p1:(GT s23 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2321 reset in 406 ms.
Product exploration explored 100000 steps with 2370 reset in 333 ms.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 1145 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/66 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 29 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-15 01:47:13] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:13] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:47:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 01:47:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:47:13] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-15 01:47:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:47:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 01:47:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:47:13] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-05-15 01:47:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:47:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 8 ms returned sat
[2022-05-15 01:47:13] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2022-05-15 01:47:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2022-05-15 01:47:13] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 38 ms.
[2022-05-15 01:47:14] [INFO ] Added : 39 causal constraints over 9 iterations in 307 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:47:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:47:14] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
[2022-05-15 01:47:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:14] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 01:47:14] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-15 01:47:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:14] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 01:47:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:47:14] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2022-05-15 01:47:14] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:14] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:47:14] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Graph (complete) has 1145 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 49 stabilizing places and 84 stable transitions
Detected a total of 49/66 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 86 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 230 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2022-05-15 01:47:15] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:15] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 01:47:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 01:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:47:16] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-15 01:47:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:47:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 01:47:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:47:16] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-05-15 01:47:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:47:16] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2022-05-15 01:47:16] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2022-05-15 01:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2022-05-15 01:47:16] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 31 ms.
[2022-05-15 01:47:16] [INFO ] Added : 39 causal constraints over 9 iterations in 279 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2382 reset in 258 ms.
Product exploration explored 100000 steps with 2360 reset in 254 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 548
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 60 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:47:17] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:17] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 01:47:18] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2022-05-15 01:47:18] [INFO ] Redundant transitions in 31 ms returned []
[2022-05-15 01:47:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:18] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:47:18] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/66 places, 548/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Product exploration explored 100000 steps with 2510 reset in 304 ms.
Product exploration explored 100000 steps with 2511 reset in 316 ms.
Built C files in :
/tmp/ltsmin10023240135194140849
[2022-05-15 01:47:18] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10023240135194140849
Running compilation step : cd /tmp/ltsmin10023240135194140849;'/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'
Compilation finished in 989 ms.
Running link step : cd /tmp/ltsmin10023240135194140849;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10023240135194140849;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1728610460477854262.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 548/548 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:47:33] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:33] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
[2022-05-15 01:47:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:47:34] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-15 01:47:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:34] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 01:47:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:47:34] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2022-05-15 01:47:34] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:47:34] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:47:34] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 548/548 transitions.
Built C files in :
/tmp/ltsmin4763882116230956795
[2022-05-15 01:47:34] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4763882116230956795
Running compilation step : cd /tmp/ltsmin4763882116230956795;'/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'
Compilation finished in 903 ms.
Running link step : cd /tmp/ltsmin4763882116230956795;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4763882116230956795;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3829904454926349118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:47:49] [INFO ] Flatten gal took : 32 ms
[2022-05-15 01:47:49] [INFO ] Flatten gal took : 30 ms
[2022-05-15 01:47:49] [INFO ] Time to serialize gal into /tmp/LTL3546518965217890314.gal : 7 ms
[2022-05-15 01:47:49] [INFO ] Time to serialize properties into /tmp/LTL3330228529702049553.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/LTL3546518965217890314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3330228529702049553.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/LTL3546518...266
Read 1 LTL properties
Checking formula 0 : !((X((F("((SORTI_A>=3)&&(SUR_PONT_A<=ATTENTE_A))"))||(X(G(X("(SUR_PONT_A>ATTENTE_A)")))))))
Formula 0 simplified : !X(F"((SORTI_A>=3)&&(SUR_PONT_A<=ATTENTE_A))" | XGX"(SUR_PONT_A>ATTENTE_A)")
Detected timeout of ITS tools.
[2022-05-15 01:48:04] [INFO ] Flatten gal took : 28 ms
[2022-05-15 01:48:04] [INFO ] Applying decomposition
[2022-05-15 01:48:04] [INFO ] Flatten gal took : 26 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/graph5582501359649508958.txt' '-o' '/tmp/graph5582501359649508958.bin' '-w' '/tmp/graph5582501359649508958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5582501359649508958.bin' '-l' '-1' '-v' '-w' '/tmp/graph5582501359649508958.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:48:05] [INFO ] Decomposing Gal with order
[2022-05-15 01:48:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:48:05] [INFO ] Removed a total of 494 redundant transitions.
[2022-05-15 01:48:05] [INFO ] Flatten gal took : 145 ms
[2022-05-15 01:48:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 8 ms.
[2022-05-15 01:48:05] [INFO ] Time to serialize gal into /tmp/LTL10906580254184699441.gal : 4 ms
[2022-05-15 01:48:05] [INFO ] Time to serialize properties into /tmp/LTL14962778451484385251.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/LTL10906580254184699441.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14962778451484385251.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/LTL1090658...268
Read 1 LTL properties
Checking formula 0 : !((X((F("((gu1.SORTI_A>=3)&&(gu1.SUR_PONT_A<=gu1.ATTENTE_A))"))||(X(G(X("(gu1.SUR_PONT_A>gu1.ATTENTE_A)")))))))
Formula 0 simplified : !X(F"((gu1.SORTI_A>=3)&&(gu1.SUR_PONT_A<=gu1.ATTENTE_A))" | XGX"(gu1.SUR_PONT_A>gu1.ATTENTE_A)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9805069586580364725
[2022-05-15 01:48:20] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9805069586580364725
Running compilation step : cd /tmp/ltsmin9805069586580364725;'/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'
Compilation finished in 906 ms.
Running link step : cd /tmp/ltsmin9805069586580364725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9805069586580364725;'/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))||X([](X((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-00 finished in 84950 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(X(p0)) U X(p1)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 11 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:48:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:48:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:48:35] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
[2022-05-15 01:48:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:48:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:48:35] [INFO ] Implicit Places using invariants in 115 ms returned []
[2022-05-15 01:48:35] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:48:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:48:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:48:36] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 377 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ 3 s47), p1:(LEQ s52 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Product exploration explored 100000 steps with 50000 reset in 330 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 8 factoid took 197 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-01 finished in 1761 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(F(p0))||G(p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
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 63 transition count 546
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 61 transition count 544
Applied a total of 10 rules in 82 ms. Remains 61 /68 variables (removed 7) and now considering 544/548 (removed 4) transitions.
[2022-05-15 01:48:37] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 61 cols
[2022-05-15 01:48:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:48:37] [INFO ] Implicit Places using invariants in 147 ms returned []
[2022-05-15 01:48:37] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 61 cols
[2022-05-15 01:48:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:48:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:48:37] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 336 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/68 places, 544/548 transitions.
Applied a total of 0 rules in 23 ms. Remains 60 /60 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/68 places, 544/548 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08 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 s0 s23), p0:(LEQ 3 s22)], 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 7205 reset in 339 ms.
Product exploration explored 100000 steps with 7213 reset in 298 ms.
Computed a total of 45 stabilizing places and 82 stable transitions
Computed a total of 45 stabilizing places and 82 stable transitions
Detected a total of 45/60 stabilizing places and 82/544 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 229 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 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 98 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 254 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 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-15 01:48:39] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:48:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 01:48:39] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 01:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:48:39] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-05-15 01:48:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:48:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 01:48:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:48:39] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-15 01:48:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:48:39] [INFO ] [Nat]Added 22 Read/Feed constraints in 60 ms returned sat
[2022-05-15 01:48:39] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2022-05-15 01:48:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2022-05-15 01:48:39] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 73 transitions) in 28 ms.
[2022-05-15 01:48:39] [INFO ] Added : 14 causal constraints over 5 iterations in 124 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 544/544 transitions.
Applied a total of 0 rules in 18 ms. Remains 60 /60 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2022-05-15 01:48:39] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:48:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:48:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2022-05-15 01:48:39] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:48:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 01:48:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:48:39] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2022-05-15 01:48:39] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-15 01:48:39] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:48:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:48:40] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 544/544 transitions.
Computed a total of 45 stabilizing places and 82 stable transitions
Computed a total of 45 stabilizing places and 82 stable transitions
Detected a total of 45/60 stabilizing places and 82/544 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 209 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 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 98 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 347 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 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-15 01:48:40] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:48:40] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:48:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 01:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:48:41] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-05-15 01:48:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:48:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-15 01:48:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:48:41] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-15 01:48:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:48:41] [INFO ] [Nat]Added 22 Read/Feed constraints in 61 ms returned sat
[2022-05-15 01:48:41] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2022-05-15 01:48:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-05-15 01:48:41] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 73 transitions) in 19 ms.
[2022-05-15 01:48:41] [INFO ] Added : 14 causal constraints over 5 iterations in 92 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7313 reset in 262 ms.
Product exploration explored 100000 steps with 7411 reset in 266 ms.
Built C files in :
/tmp/ltsmin13793245780605659646
[2022-05-15 01:48:42] [INFO ] Computing symmetric may disable matrix : 544 transitions.
[2022-05-15 01:48:42] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:48:42] [INFO ] Computing symmetric may enable matrix : 544 transitions.
[2022-05-15 01:48:42] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:48:42] [INFO ] Computing Do-Not-Accords matrix : 544 transitions.
[2022-05-15 01:48:42] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:48:42] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13793245780605659646
Running compilation step : cd /tmp/ltsmin13793245780605659646;'/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'
Compilation finished in 1550 ms.
Running link step : cd /tmp/ltsmin13793245780605659646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13793245780605659646;'/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' '--hoa' '/tmp/stateBased7494306105515241815.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 544/544 transitions.
Applied a total of 0 rules in 18 ms. Remains 60 /60 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2022-05-15 01:48:57] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:48:57] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-15 01:48:57] [INFO ] Implicit Places using invariants in 120 ms returned []
[2022-05-15 01:48:57] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:48:57] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-15 01:48:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:48:57] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2022-05-15 01:48:57] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-15 01:48:57] [INFO ] Flow matrix only has 126 transitions (discarded 418 similar events)
// Phase 1: matrix 126 rows 60 cols
[2022-05-15 01:48:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:48:57] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 60/60 places, 544/544 transitions.
Built C files in :
/tmp/ltsmin4146851360485119808
[2022-05-15 01:48:57] [INFO ] Computing symmetric may disable matrix : 544 transitions.
[2022-05-15 01:48:57] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:48:57] [INFO ] Computing symmetric may enable matrix : 544 transitions.
[2022-05-15 01:48:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:48:57] [INFO ] Computing Do-Not-Accords matrix : 544 transitions.
[2022-05-15 01:48:57] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:48:57] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4146851360485119808
Running compilation step : cd /tmp/ltsmin4146851360485119808;'/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'
Compilation finished in 1548 ms.
Running link step : cd /tmp/ltsmin4146851360485119808;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4146851360485119808;'/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' '--hoa' '/tmp/stateBased1325081922424498027.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:49:12] [INFO ] Flatten gal took : 24 ms
[2022-05-15 01:49:12] [INFO ] Flatten gal took : 26 ms
[2022-05-15 01:49:12] [INFO ] Time to serialize gal into /tmp/LTL9195929316830453012.gal : 4 ms
[2022-05-15 01:49:12] [INFO ] Time to serialize properties into /tmp/LTL3601429199830898652.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/LTL9195929316830453012.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3601429199830898652.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/LTL9195929...266
Read 1 LTL properties
Checking formula 0 : !((F(X((G(F("(ATTENTE_A>=3)")))||(G("(ROUTE_A<=CONTROLEUR_1)"))))))
Formula 0 simplified : !FX(GF"(ATTENTE_A>=3)" | G"(ROUTE_A<=CONTROLEUR_1)")
Reverse transition relation is NOT exact ! Due to transitions t0, t45, t22.t21, t23.t21, t24.t21, t25.t21, t26.t21, t27.t21, t28.t21, t29.t21, t30.t21, t31...4460
Computing Next relation with stutter on 20 deadlock states
Detected timeout of ITS tools.
[2022-05-15 01:49:27] [INFO ] Flatten gal took : 22 ms
[2022-05-15 01:49:27] [INFO ] Applying decomposition
[2022-05-15 01:49:27] [INFO ] Flatten gal took : 21 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/graph6322068967881718534.txt' '-o' '/tmp/graph6322068967881718534.bin' '-w' '/tmp/graph6322068967881718534.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6322068967881718534.bin' '-l' '-1' '-v' '-w' '/tmp/graph6322068967881718534.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:49:27] [INFO ] Decomposing Gal with order
[2022-05-15 01:49:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:49:27] [INFO ] Removed a total of 706 redundant transitions.
[2022-05-15 01:49:27] [INFO ] Flatten gal took : 76 ms
[2022-05-15 01:49:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 6 ms.
[2022-05-15 01:49:28] [INFO ] Time to serialize gal into /tmp/LTL8020608822214099120.gal : 2 ms
[2022-05-15 01:49:28] [INFO ] Time to serialize properties into /tmp/LTL13571806289157862702.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/LTL8020608822214099120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13571806289157862702.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/LTL8020608...267
Read 1 LTL properties
Checking formula 0 : !((F(X((G(F("(gi1.gu1.ATTENTE_A>=3)")))||(G("(gu0.ROUTE_A<=gu0.CONTROLEUR_1)"))))))
Formula 0 simplified : !FX(GF"(gi1.gu1.ATTENTE_A>=3)" | G"(gu0.ROUTE_A<=gu0.CONTROLEUR_1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16195816270793555288
[2022-05-15 01:49:43] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16195816270793555288
Running compilation step : cd /tmp/ltsmin16195816270793555288;'/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'
Compilation finished in 908 ms.
Running link step : cd /tmp/ltsmin16195816270793555288;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16195816270793555288;'/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'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08 finished in 80930 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(!(G(p0) U p1)))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Applied a total of 2 rules in 3 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:49:58] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:49:58] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:49:58] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
[2022-05-15 01:49:58] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:49:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:49:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-15 01:49:58] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2022-05-15 01:49:58] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:49:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:49:58] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 347 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 548/548 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, (AND p1 p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s22), p0:(LEQ s62 s50)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1042 reset in 254 ms.
Product exploration explored 100000 steps with 1028 reset in 255 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/65 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[p1, p1, p1, (AND p1 p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[p1, p1, p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, (AND p1 p0)]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:50:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:50:00] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
[2022-05-15 01:50:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:00] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:50:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2022-05-15 01:50:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:50:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:50:00] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2022-05-15 01:50:00] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:00] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:50:00] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 548/548 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/65 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 195 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p1, (AND p1 p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 251 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 247 ms :[p1, p1, p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 147 ms :[p1, p1, p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p1, (AND p1 p0)]
Product exploration explored 100000 steps with 1040 reset in 255 ms.
Product exploration explored 100000 steps with 1045 reset in 261 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 131 ms :[p1, p1, p1, (AND p1 p0)]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 548
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 23 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:50:02] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:02] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:50:03] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
[2022-05-15 01:50:03] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 01:50:03] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:03] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:50:03] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 548/548 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 548/548 transitions.
Product exploration explored 100000 steps with 1177 reset in 262 ms.
Product exploration explored 100000 steps with 1146 reset in 283 ms.
Built C files in :
/tmp/ltsmin5928729822542702848
[2022-05-15 01:50:03] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5928729822542702848
Running compilation step : cd /tmp/ltsmin5928729822542702848;'/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'
Compilation finished in 905 ms.
Running link step : cd /tmp/ltsmin5928729822542702848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5928729822542702848;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3886623219777723973.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:50:18] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:18] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:50:19] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
[2022-05-15 01:50:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:50:19] [INFO ] Implicit Places using invariants in 99 ms returned []
[2022-05-15 01:50:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:19] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:50:19] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:50:19] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2022-05-15 01:50:19] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:50:19] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:50:19] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 548/548 transitions.
Built C files in :
/tmp/ltsmin1652346641035880987
[2022-05-15 01:50:19] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1652346641035880987
Running compilation step : cd /tmp/ltsmin1652346641035880987;'/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'
Compilation finished in 905 ms.
Running link step : cd /tmp/ltsmin1652346641035880987;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1652346641035880987;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1418859119610369535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:50:34] [INFO ] Flatten gal took : 20 ms
[2022-05-15 01:50:34] [INFO ] Flatten gal took : 21 ms
[2022-05-15 01:50:34] [INFO ] Time to serialize gal into /tmp/LTL8385106799111982125.gal : 60 ms
[2022-05-15 01:50:34] [INFO ] Time to serialize properties into /tmp/LTL4329203363981825480.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/LTL8385106799111982125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4329203363981825480.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/LTL8385106...266
Read 1 LTL properties
Checking formula 0 : !((F(X(X(!((G("(COMPTEUR_8<=SUR_PONT_B)"))U("(ATTENTE_A>=1)")))))))
Formula 0 simplified : !FXX!(G"(COMPTEUR_8<=SUR_PONT_B)" U "(ATTENTE_A>=1)")
Detected timeout of ITS tools.
[2022-05-15 01:50:49] [INFO ] Flatten gal took : 21 ms
[2022-05-15 01:50:49] [INFO ] Applying decomposition
[2022-05-15 01:50:49] [INFO ] Flatten gal took : 18 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/graph10271296813245906683.txt' '-o' '/tmp/graph10271296813245906683.bin' '-w' '/tmp/graph10271296813245906683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10271296813245906683.bin' '-l' '-1' '-v' '-w' '/tmp/graph10271296813245906683.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:50:49] [INFO ] Decomposing Gal with order
[2022-05-15 01:50:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:50:50] [INFO ] Removed a total of 526 redundant transitions.
[2022-05-15 01:50:50] [INFO ] Flatten gal took : 55 ms
[2022-05-15 01:50:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 5 ms.
[2022-05-15 01:50:50] [INFO ] Time to serialize gal into /tmp/LTL2411941586032617462.gal : 2 ms
[2022-05-15 01:50:50] [INFO ] Time to serialize properties into /tmp/LTL1220737200516884595.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/LTL2411941586032617462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1220737200516884595.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/LTL2411941...266
Read 1 LTL properties
Checking formula 0 : !((F(X(X(!((G("(gu2.COMPTEUR_8<=gu2.SUR_PONT_B)"))U("(gi0.gu0.ATTENTE_A>=1)")))))))
Formula 0 simplified : !FXX!(G"(gu2.COMPTEUR_8<=gu2.SUR_PONT_B)" U "(gi0.gu0.ATTENTE_A>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12947895996444210935
[2022-05-15 01:51:05] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12947895996444210935
Running compilation step : cd /tmp/ltsmin12947895996444210935;'/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'
Compilation finished in 908 ms.
Running link step : cd /tmp/ltsmin12947895996444210935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12947895996444210935;'/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(!([]((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09 finished in 82047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((X(p0)||(G(X(p1))&&p0)))))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 548
Applied a total of 1 rules in 6 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:51:20] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:51:20] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:51:20] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
[2022-05-15 01:51:20] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:51:20] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:51:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-15 01:51:20] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:51:20] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 01:51:20] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:20] [INFO ] Implicit Places using invariants and state equation in 221 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 329 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/68 places, 548/548 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GT 2 s24), p1:(GT 1 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-12 finished in 792 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U F(p0))||X(p1))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 548
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 547
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 547
Applied a total of 4 rules in 8 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:51:20] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:51:20] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:51:21] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
[2022-05-15 01:51:21] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:51:21] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:51:21] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-15 01:51:21] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:51:21] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:51:21] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:21] [INFO ] Implicit Places using invariants and state equation in 231 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 336 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/68 places, 547/548 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s47), p1:(OR (GT 3 s23) (LEQ 1 s47))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25449 reset in 285 ms.
Product exploration explored 100000 steps with 25688 reset in 305 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 3 factoid took 676 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2022-05-15 01:51:23] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:51:23] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:51:23] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:51:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:51:23] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-15 01:51:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:51:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:51:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:51:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-15 01:51:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:23] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2022-05-15 01:51:23] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 17 ms.
[2022-05-15 01:51:24] [INFO ] Added : 11 causal constraints over 4 iterations in 70 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:51:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:51:24] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:51:24] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
[2022-05-15 01:51:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:51:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2022-05-15 01:51:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:51:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:24] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2022-05-15 01:51:24] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:51:24] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:24] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2022-05-15 01:51:25] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:51:25] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:25] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:51:25] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-05-15 01:51:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:51:25] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:51:25] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-15 01:51:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:25] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2022-05-15 01:51:25] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 17 ms.
[2022-05-15 01:51:25] [INFO ] Added : 11 causal constraints over 4 iterations in 68 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 25333 reset in 268 ms.
Product exploration explored 100000 steps with 25536 reset in 278 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 20 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:51:26] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:51:26] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:51:26] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
[2022-05-15 01:51:26] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 01:51:26] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:51:26] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:27] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Product exploration explored 100000 steps with 25414 reset in 455 ms.
Product exploration explored 100000 steps with 25398 reset in 461 ms.
Built C files in :
/tmp/ltsmin1590902135476492982
[2022-05-15 01:51:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1590902135476492982
Running compilation step : cd /tmp/ltsmin1590902135476492982;'/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'
Compilation finished in 970 ms.
Running link step : cd /tmp/ltsmin1590902135476492982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1590902135476492982;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8986631777719965254.hoa' '--buchi-type=spotba'
LTSmin run took 417 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-13 finished in 8513 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 67 /68 variables (removed 1) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:51:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:51:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:51:29] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
[2022-05-15 01:51:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:51:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:51:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2022-05-15 01:51:29] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 67 cols
[2022-05-15 01:51:29] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 01:51:29] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:30] [INFO ] Implicit Places using invariants and state equation in 235 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 345 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/68 places, 548/548 transitions.
Applied a total of 0 rules in 26 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 65/68 places, 548/548 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s52 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1678 reset in 210 ms.
Product exploration explored 100000 steps with 1687 reset in 212 ms.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 1101 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/65 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=81 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2022-05-15 01:51:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:51:31] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-15 01:51:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:51:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:51:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:51:31] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-15 01:51:31] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:31] [INFO ] [Nat]Added 22 Read/Feed constraints in 187 ms returned sat
[2022-05-15 01:51:31] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 20 ms.
[2022-05-15 01:51:31] [INFO ] Added : 28 causal constraints over 6 iterations in 138 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 19 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:51:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:31] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
[2022-05-15 01:51:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:51:31] [INFO ] Implicit Places using invariants in 94 ms returned []
[2022-05-15 01:51:31] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:32] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2022-05-15 01:51:32] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 01:51:32] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:32] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 548/548 transitions.
Computed a total of 48 stabilizing places and 84 stable transitions
Graph (complete) has 1101 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 48 stabilizing places and 84 stable transitions
Detected a total of 48/65 stabilizing places and 84/548 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 77 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=38 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 279 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2022-05-15 01:51:33] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:33] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:51:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 01:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:51:33] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-15 01:51:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:51:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:51:33] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-15 01:51:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 190 ms returned sat
[2022-05-15 01:51:33] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 14 ms.
[2022-05-15 01:51:33] [INFO ] Added : 28 causal constraints over 6 iterations in 143 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1677 reset in 227 ms.
Product exploration explored 100000 steps with 1679 reset in 231 ms.
Built C files in :
/tmp/ltsmin5620758103967839180
[2022-05-15 01:51:34] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 01:51:34] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:51:34] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 01:51:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:51:34] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 01:51:34] [INFO ] Computation of Completed DNA matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:51:34] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5620758103967839180
Running compilation step : cd /tmp/ltsmin5620758103967839180;'/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'
Compilation finished in 1534 ms.
Running link step : cd /tmp/ltsmin5620758103967839180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5620758103967839180;'/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' '--hoa' '/tmp/stateBased16881768862852202530.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 548/548 transitions.
Applied a total of 0 rules in 30 ms. Remains 65 /65 variables (removed 0) and now considering 548/548 (removed 0) transitions.
[2022-05-15 01:51:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:49] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:51:49] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
[2022-05-15 01:51:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:49] [INFO ] Computed 5 place invariants in 8 ms
[2022-05-15 01:51:49] [INFO ] Implicit Places using invariants in 100 ms returned []
[2022-05-15 01:51:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:49] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:51:49] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2022-05-15 01:51:49] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 01:51:49] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 65 cols
[2022-05-15 01:51:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:51:50] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 548/548 transitions.
Built C files in :
/tmp/ltsmin17805734262664607814
[2022-05-15 01:51:50] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 01:51:50] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:51:50] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 01:51:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:51:50] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 01:51:50] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:51:50] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17805734262664607814
Running compilation step : cd /tmp/ltsmin17805734262664607814;'/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'
Compilation finished in 1646 ms.
Running link step : cd /tmp/ltsmin17805734262664607814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17805734262664607814;'/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' '--hoa' '/tmp/stateBased4353552184415672825.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:52:05] [INFO ] Flatten gal took : 17 ms
[2022-05-15 01:52:05] [INFO ] Flatten gal took : 16 ms
[2022-05-15 01:52:05] [INFO ] Time to serialize gal into /tmp/LTL991279089687360065.gal : 4 ms
[2022-05-15 01:52:05] [INFO ] Time to serialize properties into /tmp/LTL11281741636196336896.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/LTL991279089687360065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11281741636196336896.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/LTL9912790...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(SORTI_B>SUR_PONT_A)"))))
Formula 0 simplified : !GF"(SORTI_B>SUR_PONT_A)"
Detected timeout of ITS tools.
[2022-05-15 01:52:20] [INFO ] Flatten gal took : 16 ms
[2022-05-15 01:52:20] [INFO ] Applying decomposition
[2022-05-15 01:52:20] [INFO ] Flatten gal took : 16 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/graph14776530819749036170.txt' '-o' '/tmp/graph14776530819749036170.bin' '-w' '/tmp/graph14776530819749036170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14776530819749036170.bin' '-l' '-1' '-v' '-w' '/tmp/graph14776530819749036170.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:52:20] [INFO ] Decomposing Gal with order
[2022-05-15 01:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:52:20] [INFO ] Removed a total of 474 redundant transitions.
[2022-05-15 01:52:20] [INFO ] Flatten gal took : 49 ms
[2022-05-15 01:52:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 2 ms.
[2022-05-15 01:52:20] [INFO ] Time to serialize gal into /tmp/LTL9947687517085509394.gal : 3 ms
[2022-05-15 01:52:20] [INFO ] Time to serialize properties into /tmp/LTL6457679416062859224.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/LTL9947687517085509394.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6457679416062859224.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/LTL9947687...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu2.SORTI_B>gu2.SUR_PONT_A)"))))
Formula 0 simplified : !GF"(gu2.SORTI_B>gu2.SUR_PONT_A)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14842912789498528280
[2022-05-15 01:52:35] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14842912789498528280
Running compilation step : cd /tmp/ltsmin14842912789498528280;'/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'
Compilation finished in 890 ms.
Running link step : cd /tmp/ltsmin14842912789498528280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14842912789498528280;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14 finished in 80952 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(X(p1))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G(F(p0))||G(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(!(G(p0) U p1)))))'
Found a CL insensitive property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09
Stuttering acceptance computed with spot in 147 ms :[p1, p1, p1, (AND p1 p0)]
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 1190 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.7 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 17 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2022-05-15 01:52:50] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:52:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:52:51] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
[2022-05-15 01:52:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:52:51] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:52:51] [INFO ] Implicit Places using invariants in 97 ms returned []
[2022-05-15 01:52:51] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2022-05-15 01:52:51] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:52:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:52:51] [INFO ] Implicit Places using invariants and state equation in 219 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 320 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 64/68 places, 547/548 transitions.
Applied a total of 0 rules in 10 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 64/68 places, 547/548 transitions.
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s22), p0:(LEQ s61 s49)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1137 reset in 252 ms.
Product exploration explored 100000 steps with 1156 reset in 257 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 1306 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, (AND p1 p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[p1, p1, p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 142 ms :[p1, p1, p1, (AND p1 p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 3 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:52:53] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:52:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:52:54] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
[2022-05-15 01:52:54] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:52:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:52:54] [INFO ] Implicit Places using invariants in 109 ms returned []
[2022-05-15 01:52:54] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:52:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:52:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:52:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2022-05-15 01:52:54] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:52:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:52:54] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/64 stabilizing places and 83/547 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 168 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[p1, p1, p1, (AND p1 p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) p0), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 158 ms :[p1, p1, p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 139 ms :[p1, p1, p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 136 ms :[p1, p1, p1, (AND p1 p0)]
Product exploration explored 100000 steps with 1175 reset in 246 ms.
Product exploration explored 100000 steps with 1165 reset in 261 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 175 ms :[p1, p1, p1, (AND p1 p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 18 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:52:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:52:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:52:56] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
[2022-05-15 01:52:56] [INFO ] Redundant transitions in 3 ms returned []
[2022-05-15 01:52:56] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:52:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:52:56] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Product exploration explored 100000 steps with 1145 reset in 260 ms.
Product exploration explored 100000 steps with 1156 reset in 271 ms.
Built C files in :
/tmp/ltsmin16443462518539644937
[2022-05-15 01:52:57] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16443462518539644937
Running compilation step : cd /tmp/ltsmin16443462518539644937;'/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'
Compilation finished in 914 ms.
Running link step : cd /tmp/ltsmin16443462518539644937;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16443462518539644937;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12650066218267994263.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 547/547 transitions.
Applied a total of 0 rules in 5 ms. Remains 64 /64 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2022-05-15 01:53:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:53:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:53:12] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
[2022-05-15 01:53:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:53:12] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:53:12] [INFO ] Implicit Places using invariants in 100 ms returned []
[2022-05-15 01:53:12] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:53:12] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:53:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:53:13] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2022-05-15 01:53:13] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 64 cols
[2022-05-15 01:53:13] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:53:13] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 547/547 transitions.
Built C files in :
/tmp/ltsmin2856526780832605932
[2022-05-15 01:53:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2856526780832605932
Running compilation step : cd /tmp/ltsmin2856526780832605932;'/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'
Compilation finished in 893 ms.
Running link step : cd /tmp/ltsmin2856526780832605932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2856526780832605932;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11751772781492470339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:53:28] [INFO ] Flatten gal took : 22 ms
[2022-05-15 01:53:28] [INFO ] Flatten gal took : 16 ms
[2022-05-15 01:53:28] [INFO ] Time to serialize gal into /tmp/LTL10024335134228766291.gal : 2 ms
[2022-05-15 01:53:28] [INFO ] Time to serialize properties into /tmp/LTL10796416061049957438.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/LTL10024335134228766291.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10796416061049957438.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/LTL1002433...268
Read 1 LTL properties
Checking formula 0 : !((F(X(X(!((G("(COMPTEUR_8<=SUR_PONT_B)"))U("(ATTENTE_A>=1)")))))))
Formula 0 simplified : !FXX!(G"(COMPTEUR_8<=SUR_PONT_B)" U "(ATTENTE_A>=1)")
Detected timeout of ITS tools.
[2022-05-15 01:53:43] [INFO ] Flatten gal took : 16 ms
[2022-05-15 01:53:43] [INFO ] Applying decomposition
[2022-05-15 01:53:43] [INFO ] Flatten gal took : 16 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/graph15547026334299125703.txt' '-o' '/tmp/graph15547026334299125703.bin' '-w' '/tmp/graph15547026334299125703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15547026334299125703.bin' '-l' '-1' '-v' '-w' '/tmp/graph15547026334299125703.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:53:43] [INFO ] Decomposing Gal with order
[2022-05-15 01:53:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:53:43] [INFO ] Removed a total of 555 redundant transitions.
[2022-05-15 01:53:43] [INFO ] Flatten gal took : 55 ms
[2022-05-15 01:53:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 4 ms.
[2022-05-15 01:53:43] [INFO ] Time to serialize gal into /tmp/LTL12971663747476803666.gal : 2 ms
[2022-05-15 01:53:43] [INFO ] Time to serialize properties into /tmp/LTL11694653306616696089.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/LTL12971663747476803666.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11694653306616696089.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/LTL1297166...268
Read 1 LTL properties
Checking formula 0 : !((F(X(X(!((G("(gu2.COMPTEUR_8<=gu2.SUR_PONT_B)"))U("(gi0.gu0.ATTENTE_A>=1)")))))))
Formula 0 simplified : !FXX!(G"(gu2.COMPTEUR_8<=gu2.SUR_PONT_B)" U "(gi0.gu0.ATTENTE_A>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13417232983558172116
[2022-05-15 01:53:58] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13417232983558172116
Running compilation step : cd /tmp/ltsmin13417232983558172116;'/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'
Compilation finished in 890 ms.
Running link step : cd /tmp/ltsmin13417232983558172116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13417232983558172116;'/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(!([]((LTLAPp0==true)) U (LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09 finished in 83196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-15 01:54:13] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8086373260465579012
[2022-05-15 01:54:13] [INFO ] Computing symmetric may disable matrix : 548 transitions.
[2022-05-15 01:54:13] [INFO ] Applying decomposition
[2022-05-15 01:54:13] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:54:13] [INFO ] Computing symmetric may enable matrix : 548 transitions.
[2022-05-15 01:54:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:54:13] [INFO ] Flatten gal took : 16 ms
[2022-05-15 01:54:14] [INFO ] Computing Do-Not-Accords matrix : 548 transitions.
[2022-05-15 01:54:14] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph14109734507288427423.txt' '-o' '/tmp/graph14109734507288427423.bin' '-w' '/tmp/graph14109734507288427423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14109734507288427423.bin' '-l' '-1' '-v' '-w' '/tmp/graph14109734507288427423.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:54:14] [INFO ] Decomposing Gal with order
[2022-05-15 01:54:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:54:14] [INFO ] Built C files in 90ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8086373260465579012
Running compilation step : cd /tmp/ltsmin8086373260465579012;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-15 01:54:14] [INFO ] Removed a total of 797 redundant transitions.
[2022-05-15 01:54:14] [INFO ] Flatten gal took : 54 ms
[2022-05-15 01:54:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 5 ms.
[2022-05-15 01:54:14] [INFO ] Time to serialize gal into /tmp/LTLCardinality10167146849157527223.gal : 1 ms
[2022-05-15 01:54:14] [INFO ] Time to serialize properties into /tmp/LTLCardinality2887435862659255537.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/LTLCardinality10167146849157527223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2887435862659255537.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 4 LTL properties
Checking formula 0 : !((X((F("((gu0.SORTI_A>=3)&&(gu0.SUR_PONT_A<=gu0.ATTENTE_A))"))||(X(G(X("(gu0.SUR_PONT_A>gu0.ATTENTE_A)")))))))
Formula 0 simplified : !X(F"((gu0.SORTI_A>=3)&&(gu0.SUR_PONT_A<=gu0.ATTENTE_A))" | XGX"(gu0.SUR_PONT_A>gu0.ATTENTE_A)")
Compilation finished in 1526 ms.
Running link step : cd /tmp/ltsmin8086373260465579012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin8086373260465579012;'/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))||X([](X((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 59213 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8086373260465579012;'/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(([](<>((LTLAPp2==true)))||[]((LTLAPp3==true)))))' '--buchi-type=spotba'
LTSmin run took 107804 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8086373260465579012;'/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)) U (LTLAPp5==true)))))' '--buchi-type=spotba'
LTSmin run took 62003 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8086373260465579012;'/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' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin8086373260465579012;'/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' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin8086373260465579012;'/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' '[](<>((LTLAPp6==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 02:16:36] [INFO ] Flatten gal took : 30 ms
[2022-05-15 02:16:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality13194700623464939083.gal : 3 ms
[2022-05-15 02:16:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality3638035569057610439.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/LTLCardinality13194700623464939083.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3638035569057610439.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 1 LTL properties
Checking formula 0 : !((G(F("(SORTI_B>SUR_PONT_A)"))))
Formula 0 simplified : !GF"(SORTI_B>SUR_PONT_A)"
LTSmin run took 1338968 ms.
FORMULA BridgeAndVehicles-PT-V20P10N10-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2896095 ms.
BK_STOP 1652582124044
--------------------
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-PT-V20P10N10"
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-PT-V20P10N10, 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-165251918200179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N10.tgz
mv BridgeAndVehicles-PT-V20P10N10 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 '
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 ;