About the Execution of ITS-Tools for BridgeAndVehicles-PT-V20P10N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10309.571 | 3600000.00 | 13947916.00 | 751.10 | FFTF?TFFF?TTFTFF | 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-165251918200187.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-V20P10N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918200187
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 16K Apr 29 21:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 29 21:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 87K Apr 29 21:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 359K Apr 29 21:25 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 6.5K May 9 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 9 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 97K May 9 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 294K May 9 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K 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 782K 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-V20P10N20-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652581538764
Running Version 202205111006
[2022-05-15 02:25:39] [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 02:25:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 02:25:40] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2022-05-15 02:25:40] [INFO ] Transformed 78 places.
[2022-05-15 02:25:40] [INFO ] Transformed 968 transitions.
[2022-05-15 02:25:40] [INFO ] Parsed PT model containing 78 places and 968 transitions in 261 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 3 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Applied a total of 0 rules in 43 ms. Remains 78 /78 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 02:25:40] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:25:40] [INFO ] Computed 7 place invariants in 15 ms
[2022-05-15 02:25:40] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
[2022-05-15 02:25:40] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:25:40] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-15 02:25:41] [INFO ] Implicit Places using invariants in 148 ms returned []
[2022-05-15 02:25:41] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:25:41] [INFO ] Computed 7 place invariants in 7 ms
[2022-05-15 02:25:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:25:41] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2022-05-15 02:25:41] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:25:41] [INFO ] Computed 7 place invariants in 10 ms
[2022-05-15 02:25:41] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 78/78 places, 968/968 transitions.
Support contains 18 out of 78 places after structural reductions.
[2022-05-15 02:25:41] [INFO ] Flatten gal took : 100 ms
[2022-05-15 02:25:42] [INFO ] Flatten gal took : 66 ms
[2022-05-15 02:25:42] [INFO ] Input system was already deterministic with 968 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-15 02:25:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:25:42] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 02:25:42] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-15 02:25:42] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-15 02:25:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2022-05-15 02:25:43] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-05-15 02:25:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:25:43] [INFO ] After 40ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-05-15 02:25:43] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 2 ms to minimize.
[2022-05-15 02:25:43] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 1 ms to minimize.
[2022-05-15 02:25:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2022-05-15 02:25:43] [INFO ] After 398ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-15 02:25:43] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 642 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 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 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 967
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 73 transition count 966
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 72 transition count 965
Applied a total of 8 rules in 153 ms. Remains 72 /78 variables (removed 6) and now considering 965/968 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 72/78 places, 965/968 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Finished probabilistic random walk after 87 steps, run visited all 1 properties in 7 ms. (steps per millisecond=12 )
Probabilistic random walk after 87 steps, saw 67 distinct states, run finished after 7 ms. (steps per millisecond=12 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 1690 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(X(G(p1)))||F(p2)))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 968
Applied a total of 2 rules in 6 ms. Remains 76 /78 variables (removed 2) and now considering 968/968 (removed 0) transitions.
[2022-05-15 02:25:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 02:25:44] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:25:44] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
[2022-05-15 02:25:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 02:25:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:25:44] [INFO ] Implicit Places using invariants in 129 ms returned []
[2022-05-15 02:25:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 76 cols
[2022-05-15 02:25:44] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:25:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:25:45] [INFO ] Implicit Places using invariants and state equation in 527 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 666 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/78 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 75/78 places, 968/968 transitions.
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(LEQ s23 (ADD s25 s26)), p0:(LEQ 1 (ADD s51 s52)), p1:(LEQ s22 1)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N20-LTLCardinality-01 finished in 1314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 1690 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 76 transition count 967
Applied a total of 3 rules in 191 ms. Remains 76 /78 variables (removed 2) and now considering 967/968 (removed 1) transitions.
[2022-05-15 02:25:45] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 76 cols
[2022-05-15 02:25:45] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 02:25:45] [INFO ] Dead Transitions using invariants and state equation in 306 ms found 0 transitions.
[2022-05-15 02:25:45] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 76 cols
[2022-05-15 02:25:45] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 02:25:46] [INFO ] Implicit Places using invariants in 160 ms returned []
[2022-05-15 02:25:46] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 76 cols
[2022-05-15 02:25:46] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 02:25:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:25:46] [INFO ] Implicit Places using invariants and state equation in 505 ms returned [22, 49]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 680 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/78 places, 967/968 transitions.
Applied a total of 0 rules in 58 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/78 places, 967/968 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N20-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s22 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4893 reset in 463 ms.
Product exploration explored 100000 steps with 4965 reset in 374 ms.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1599 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/74 stabilizing places and 83/967 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 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
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 266 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2022-05-15 02:25:48] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:48] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:25:48] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:25:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:25:48] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-05-15 02:25:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:25:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:25:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:25:48] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-05-15 02:25:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:25:48] [INFO ] [Nat]Added 42 Read/Feed constraints in 97 ms returned sat
[2022-05-15 02:25:48] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2022-05-15 02:25:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2022-05-15 02:25:48] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 106 transitions) in 58 ms.
[2022-05-15 02:25:48] [INFO ] Added : 20 causal constraints over 4 iterations in 136 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 967/967 transitions.
Applied a total of 0 rules in 48 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-15 02:25:49] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:49] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:25:49] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
[2022-05-15 02:25:49] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:25:49] [INFO ] Implicit Places using invariants in 157 ms returned []
[2022-05-15 02:25:49] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:25:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:25:49] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2022-05-15 02:25:49] [INFO ] Redundant transitions in 62 ms returned []
[2022-05-15 02:25:49] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:49] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:25:50] [INFO ] Dead Transitions using invariants and state equation in 294 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 967/967 transitions.
Computed a total of 47 stabilizing places and 83 stable transitions
Graph (complete) has 1599 edges and 74 vertex of which 73 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 47 stabilizing places and 83 stable transitions
Detected a total of 47/74 stabilizing places and 83/967 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 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 87 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
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 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2022-05-15 02:25:50] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:50] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:25:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:25:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:25:50] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-15 02:25:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:25:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:25:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:25:51] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-15 02:25:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:25:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 97 ms returned sat
[2022-05-15 02:25:51] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2022-05-15 02:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2022-05-15 02:25:51] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 106 transitions) in 63 ms.
[2022-05-15 02:25:51] [INFO ] Added : 20 causal constraints over 4 iterations in 133 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4868 reset in 313 ms.
Product exploration explored 100000 steps with 4958 reset in 319 ms.
Built C files in :
/tmp/ltsmin1310386771203567572
[2022-05-15 02:25:52] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-15 02:25:52] [INFO ] Computation of Complete disable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:25:52] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-15 02:25:52] [INFO ] Computation of Complete enable matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:25:52] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-15 02:25:52] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:25:52] [INFO ] Built C files in 498ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1310386771203567572
Running compilation step : cd /tmp/ltsmin1310386771203567572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1310386771203567572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1310386771203567572;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 967/967 transitions.
Applied a total of 0 rules in 66 ms. Remains 74 /74 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-15 02:25:55] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:25:56] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
[2022-05-15 02:25:56] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:25:56] [INFO ] Implicit Places using invariants in 146 ms returned []
[2022-05-15 02:25:56] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:25:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:25:56] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2022-05-15 02:25:56] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-15 02:25:56] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 74 cols
[2022-05-15 02:25:56] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:25:57] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin15775884167597783141
[2022-05-15 02:25:57] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-15 02:25:57] [INFO ] Computation of Complete disable matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:25:57] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-15 02:25:57] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:25:57] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-15 02:25:57] [INFO ] Computation of Completed DNA matrix. took 40 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:25:57] [INFO ] Built C files in 230ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15775884167597783141
Running compilation step : cd /tmp/ltsmin15775884167597783141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15775884167597783141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15775884167597783141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 02:26:00] [INFO ] Flatten gal took : 44 ms
[2022-05-15 02:26:00] [INFO ] Flatten gal took : 43 ms
[2022-05-15 02:26:00] [INFO ] Time to serialize gal into /tmp/LTL6527531247362054439.gal : 10 ms
[2022-05-15 02:26:00] [INFO ] Time to serialize properties into /tmp/LTL14221177656711250158.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/LTL6527531247362054439.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14221177656711250158.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/LTL6527531...267
Read 1 LTL properties
Checking formula 0 : !((F("(SUR_PONT_A>SORTI_A)")))
Formula 0 simplified : !F"(SUR_PONT_A>SORTI_A)"
Detected timeout of ITS tools.
[2022-05-15 02:26:15] [INFO ] Flatten gal took : 41 ms
[2022-05-15 02:26:15] [INFO ] Applying decomposition
[2022-05-15 02:26:15] [INFO ] Flatten gal took : 41 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/graph1698743993160974810.txt' '-o' '/tmp/graph1698743993160974810.bin' '-w' '/tmp/graph1698743993160974810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1698743993160974810.bin' '-l' '-1' '-v' '-w' '/tmp/graph1698743993160974810.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:26:15] [INFO ] Decomposing Gal with order
[2022-05-15 02:26:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:26:16] [INFO ] Removed a total of 874 redundant transitions.
[2022-05-15 02:26:16] [INFO ] Flatten gal took : 249 ms
[2022-05-15 02:26:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 8 ms.
[2022-05-15 02:26:16] [INFO ] Time to serialize gal into /tmp/LTL3394852044926862490.gal : 8 ms
[2022-05-15 02:26:16] [INFO ] Time to serialize properties into /tmp/LTL11504176663843603875.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/LTL3394852044926862490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11504176663843603875.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/LTL3394852...267
Read 1 LTL properties
Checking formula 0 : !((F("(gu1.SUR_PONT_A>gu1.SORTI_A)")))
Formula 0 simplified : !F"(gu1.SUR_PONT_A>gu1.SORTI_A)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin784177362179467537
[2022-05-15 02:26:31] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin784177362179467537
Running compilation step : cd /tmp/ltsmin784177362179467537;'/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 1671 ms.
Running link step : cd /tmp/ltsmin784177362179467537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin784177362179467537;'/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'
LTSmin run took 2077 ms.
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V20P10N20-LTLCardinality-02 finished in 49812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 1690 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 967
Applied a total of 3 rules in 60 ms. Remains 75 /78 variables (removed 3) and now considering 967/968 (removed 1) transitions.
[2022-05-15 02:26:35] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:26:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:26:35] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
[2022-05-15 02:26:35] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:26:35] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:26:35] [INFO ] Implicit Places using invariants in 208 ms returned []
[2022-05-15 02:26:35] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:26:35] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:26:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:26:36] [INFO ] Implicit Places using invariants and state equation in 454 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 682 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/78 places, 967/968 transitions.
Applied a total of 0 rules in 53 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/78 places, 967/968 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N20-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GT s22 1) (GT 1 s0)), p0:(GT 1 s0)], 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 1183 reset in 368 ms.
Product exploration explored 100000 steps with 1171 reset in 399 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/73 stabilizing places and 83/967 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 285 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 69 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 276 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 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-15 02:26:38] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:26:38] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-15 02:26:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:26:38] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-15 02:26:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:26:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-15 02:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:26:38] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-15 02:26:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:26:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 419 ms returned sat
[2022-05-15 02:26:39] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 106 transitions) in 30 ms.
[2022-05-15 02:26:39] [INFO ] Added : 10 causal constraints over 3 iterations in 96 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 967/967 transitions.
Applied a total of 0 rules in 70 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-15 02:26:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:26:39] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
[2022-05-15 02:26:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:26:39] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-15 02:26:39] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:39] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:26:39] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:26:40] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2022-05-15 02:26:40] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-15 02:26:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:26:40] [INFO ] Dead Transitions using invariants and state equation in 300 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 967/967 transitions.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Detected a total of 46/73 stabilizing places and 83/967 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 260 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 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 69 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=34 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 287 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))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2022-05-15 02:26:41] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:41] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:26:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:26:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:26:41] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-05-15 02:26:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:26:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 02:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:26:41] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-15 02:26:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:26:42] [INFO ] [Nat]Added 42 Read/Feed constraints in 419 ms returned sat
[2022-05-15 02:26:42] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 106 transitions) in 25 ms.
[2022-05-15 02:26:42] [INFO ] Added : 10 causal constraints over 3 iterations in 99 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1182 reset in 325 ms.
Product exploration explored 100000 steps with 1189 reset in 326 ms.
Built C files in :
/tmp/ltsmin6492639554598225693
[2022-05-15 02:26:42] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-15 02:26:43] [INFO ] Computation of Complete disable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:26:43] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-15 02:26:43] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:26:43] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-15 02:26:43] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:26:43] [INFO ] Built C files in 204ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6492639554598225693
Running compilation step : cd /tmp/ltsmin6492639554598225693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6492639554598225693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6492639554598225693;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 967/967 transitions.
Applied a total of 0 rules in 37 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2022-05-15 02:26:46] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:46] [INFO ] Computed 5 place invariants in 9 ms
[2022-05-15 02:26:46] [INFO ] Dead Transitions using invariants and state equation in 477 ms found 0 transitions.
[2022-05-15 02:26:46] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:46] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:26:46] [INFO ] Implicit Places using invariants in 152 ms returned []
[2022-05-15 02:26:46] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:46] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:26:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:26:47] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2022-05-15 02:26:47] [INFO ] Redundant transitions in 14 ms returned []
[2022-05-15 02:26:47] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 73 cols
[2022-05-15 02:26:47] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:26:47] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/73 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin13971263228233001863
[2022-05-15 02:26:47] [INFO ] Computing symmetric may disable matrix : 967 transitions.
[2022-05-15 02:26:47] [INFO ] Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:26:47] [INFO ] Computing symmetric may enable matrix : 967 transitions.
[2022-05-15 02:26:47] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:26:47] [INFO ] Computing Do-Not-Accords matrix : 967 transitions.
[2022-05-15 02:26:47] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:26:47] [INFO ] Built C files in 209ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13971263228233001863
Running compilation step : cd /tmp/ltsmin13971263228233001863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13971263228233001863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13971263228233001863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 02:26:50] [INFO ] Flatten gal took : 39 ms
[2022-05-15 02:26:50] [INFO ] Flatten gal took : 38 ms
[2022-05-15 02:26:50] [INFO ] Time to serialize gal into /tmp/LTL16117123444897638696.gal : 5 ms
[2022-05-15 02:26:50] [INFO ] Time to serialize properties into /tmp/LTL2356995180961111501.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/LTL16117123444897638696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2356995180961111501.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/LTL1611712...267
Read 1 LTL properties
Checking formula 0 : !((G(F(("(ROUTE_A<1)")U((G("(ROUTE_A<1)"))||("((SUR_PONT_A>1)&&(ROUTE_A<1))"))))))
Formula 0 simplified : !GF("(ROUTE_A<1)" U ("((SUR_PONT_A>1)&&(ROUTE_A<1))" | G"(ROUTE_A<1)"))
Detected timeout of ITS tools.
[2022-05-15 02:27:05] [INFO ] Flatten gal took : 36 ms
[2022-05-15 02:27:05] [INFO ] Applying decomposition
[2022-05-15 02:27:06] [INFO ] Flatten gal took : 50 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/graph4261388165236906907.txt' '-o' '/tmp/graph4261388165236906907.bin' '-w' '/tmp/graph4261388165236906907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4261388165236906907.bin' '-l' '-1' '-v' '-w' '/tmp/graph4261388165236906907.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:27:06] [INFO ] Decomposing Gal with order
[2022-05-15 02:27:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:27:06] [INFO ] Removed a total of 1793 redundant transitions.
[2022-05-15 02:27:06] [INFO ] Flatten gal took : 313 ms
[2022-05-15 02:27:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 11 ms.
[2022-05-15 02:27:06] [INFO ] Time to serialize gal into /tmp/LTL8711069606479677780.gal : 1 ms
[2022-05-15 02:27:06] [INFO ] Time to serialize properties into /tmp/LTL7115243527926651313.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/LTL8711069606479677780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7115243527926651313.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8711069...245
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i2.u3.ROUTE_A<1)")U((G("(i2.u3.ROUTE_A<1)"))||("((u2.SUR_PONT_A>1)&&(i2.u3.ROUTE_A<1))"))))))
Formula 0 simplified : !GF("(i2.u3.ROUTE_A<1)" U ("((u2.SUR_PONT_A>1)&&(i2.u3.ROUTE_A<1))" | G"(i2.u3.ROUTE_A<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13037497133211591618
[2022-05-15 02:27:21] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13037497133211591618
Running compilation step : cd /tmp/ltsmin13037497133211591618;'/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 1656 ms.
Running link step : cd /tmp/ltsmin13037497133211591618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13037497133211591618;'/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) U ([]((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N20-LTLCardinality-04 finished in 61536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 1690 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 75 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 75 transition count 967
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 73 transition count 966
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 71 transition count 964
Applied a total of 10 rules in 90 ms. Remains 71 /78 variables (removed 7) and now considering 964/968 (removed 4) transitions.
[2022-05-15 02:27:36] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 02:27:36] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 02:27:36] [INFO ] Implicit Places using invariants in 156 ms returned []
[2022-05-15 02:27:36] [INFO ] Flow matrix only has 166 transitions (discarded 798 similar events)
// Phase 1: matrix 166 rows 71 cols
[2022-05-15 02:27:36] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 02:27:37] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:27:37] [INFO ] Implicit Places using invariants and state equation in 390 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 551 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/78 places, 964/968 transitions.
Applied a total of 0 rules in 53 ms. Remains 69 /69 variables (removed 0) and now considering 964/964 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 69/78 places, 964/968 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N20-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s23 s60)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N20-LTLCardinality-08 finished in 771 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&p1&&F(p2)) U G(!p1)))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Applied a total of 0 rules in 40 ms. Remains 78 /78 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 02:27:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:27:37] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 02:27:37] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
[2022-05-15 02:27:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:27:37] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-15 02:27:37] [INFO ] Implicit Places using invariants in 154 ms returned []
[2022-05-15 02:27:37] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:27:37] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 02:27:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:27:38] [INFO ] Implicit Places using invariants and state equation in 394 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 554 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/78 places, 968/968 transitions.
Applied a total of 0 rules in 43 ms. Remains 77 /77 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 77/78 places, 968/968 transitions.
Stuttering acceptance computed with spot in 135 ms :[p1, (NOT p0), (NOT p2), p1, true]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N20-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT 2 s54), p0:(LEQ s48 s26), p2:(LEQ s14 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 723 reset in 361 ms.
Product exploration explored 100000 steps with 716 reset in 355 ms.
Computed a total of 50 stabilizing places and 84 stable transitions
Graph (complete) has 1646 edges and 77 vertex of which 75 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 50 stabilizing places and 84 stable transitions
Detected a total of 50/77 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p2)))), (X p2), (X p1), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 572 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 149 ms :[p1, (NOT p0), (NOT p2), p1, true]
Finished random walk after 9432 steps, including 54 resets, run visited all 5 properties in 64 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p2)))), (X p2), (X p1), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 10 factoid took 787 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 157 ms :[p1, (NOT p0), (NOT p2), p1, true]
Stuttering acceptance computed with spot in 147 ms :[p1, (NOT p0), (NOT p2), p1, true]
[2022-05-15 02:27:41] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:41] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 02:27:41] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 02:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:27:41] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2022-05-15 02:27:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:27:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-15 02:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:27:41] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-15 02:27:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:27:41] [INFO ] [Nat]Added 42 Read/Feed constraints in 66 ms returned sat
[2022-05-15 02:27:41] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2022-05-15 02:27:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-05-15 02:27:42] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 24 ms.
[2022-05-15 02:27:42] [INFO ] Added : 26 causal constraints over 6 iterations in 143 ms. Result :sat
Could not prove EG p1
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 968/968 transitions.
Applied a total of 0 rules in 42 ms. Remains 77 /77 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 02:27:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 02:27:42] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
[2022-05-15 02:27:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:42] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 02:27:42] [INFO ] Implicit Places using invariants in 135 ms returned []
[2022-05-15 02:27:42] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 02:27:42] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:27:43] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
[2022-05-15 02:27:43] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-15 02:27:43] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:43] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 02:27:43] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 968/968 transitions.
Computed a total of 50 stabilizing places and 84 stable transitions
Graph (complete) has 1646 edges and 77 vertex of which 75 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 50 stabilizing places and 84 stable transitions
Detected a total of 50/77 stabilizing places and 84/968 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p2)))), (X p2), (X p1), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 10 factoid took 608 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[p1, (NOT p0), (NOT p2), p1, true]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :4
Finished Best-First random walk after 201 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=201 )
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p2)))), (X p2), (X p1), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p2)), (F (NOT p0)), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 10 factoid took 743 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 5 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 215 ms :[p1, (NOT p0), (NOT p2), p1, true]
Stuttering acceptance computed with spot in 152 ms :[p1, (NOT p0), (NOT p2), p1, true]
[2022-05-15 02:27:45] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:45] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-15 02:27:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 02:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 02:27:45] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-15 02:27:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 02:27:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-15 02:27:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 02:27:45] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-15 02:27:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:27:46] [INFO ] [Nat]Added 42 Read/Feed constraints in 67 ms returned sat
[2022-05-15 02:27:46] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 1 ms to minimize.
[2022-05-15 02:27:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2022-05-15 02:27:46] [INFO ] Computed and/alt/rep : 60/118/60 causal constraints (skipped 107 transitions) in 23 ms.
[2022-05-15 02:27:46] [INFO ] Added : 26 causal constraints over 6 iterations in 146 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 184 ms :[p1, (NOT p0), (NOT p2), p1, true]
Product exploration explored 100000 steps with 735 reset in 364 ms.
Product exploration explored 100000 steps with 725 reset in 370 ms.
Built C files in :
/tmp/ltsmin4600741698722116989
[2022-05-15 02:27:47] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2022-05-15 02:27:47] [INFO ] Computation of Complete disable matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:27:47] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2022-05-15 02:27:47] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:27:47] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2022-05-15 02:27:47] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:27:47] [INFO ] Built C files in 218ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4600741698722116989
Running compilation step : cd /tmp/ltsmin4600741698722116989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4600741698722116989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4600741698722116989;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 968/968 transitions.
Applied a total of 0 rules in 47 ms. Remains 77 /77 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 02:27:50] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:50] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 02:27:50] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
[2022-05-15 02:27:50] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:50] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 02:27:51] [INFO ] Implicit Places using invariants in 133 ms returned []
[2022-05-15 02:27:51] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:51] [INFO ] Computed 6 place invariants in 13 ms
[2022-05-15 02:27:51] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:27:51] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2022-05-15 02:27:51] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-15 02:27:51] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 77 cols
[2022-05-15 02:27:51] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 02:27:51] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 77/77 places, 968/968 transitions.
Built C files in :
/tmp/ltsmin4835476119011195468
[2022-05-15 02:27:51] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2022-05-15 02:27:51] [INFO ] Computation of Complete disable matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:27:51] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2022-05-15 02:27:51] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:27:51] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2022-05-15 02:27:51] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:27:51] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4835476119011195468
Running compilation step : cd /tmp/ltsmin4835476119011195468;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4835476119011195468;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4835476119011195468;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-15 02:27:55] [INFO ] Flatten gal took : 53 ms
[2022-05-15 02:27:55] [INFO ] Flatten gal took : 38 ms
[2022-05-15 02:27:55] [INFO ] Time to serialize gal into /tmp/LTL17215541539223949429.gal : 6 ms
[2022-05-15 02:27:55] [INFO ] Time to serialize properties into /tmp/LTL10428089560406013243.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/LTL17215541539223949429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10428089560406013243.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/LTL1721554...268
Read 1 LTL properties
Checking formula 0 : !(((((F("(ATTENTE_B<=CONTROLEUR_2)"))&&("(SORTI_B<2)"))&&(F("(NB_ATTENTE_A_13<=SORTI_A)")))U(G("(SORTI_B>=2)"))))
Formula 0 simplified : !(("(SORTI_B<2)" & F"(ATTENTE_B<=CONTROLEUR_2)" & F"(NB_ATTENTE_A_13<=SORTI_A)") U G"(SORTI_B>=2)")
Detected timeout of ITS tools.
[2022-05-15 02:28:10] [INFO ] Flatten gal took : 35 ms
[2022-05-15 02:28:10] [INFO ] Applying decomposition
[2022-05-15 02:28:10] [INFO ] Flatten gal took : 63 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/graph6666884246817360444.txt' '-o' '/tmp/graph6666884246817360444.bin' '-w' '/tmp/graph6666884246817360444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6666884246817360444.bin' '-l' '-1' '-v' '-w' '/tmp/graph6666884246817360444.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:28:10] [INFO ] Decomposing Gal with order
[2022-05-15 02:28:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:28:10] [INFO ] Removed a total of 1356 redundant transitions.
[2022-05-15 02:28:10] [INFO ] Flatten gal took : 92 ms
[2022-05-15 02:28:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 213 labels/synchronizations in 8 ms.
[2022-05-15 02:28:10] [INFO ] Time to serialize gal into /tmp/LTL2136532575067215267.gal : 19 ms
[2022-05-15 02:28:10] [INFO ] Time to serialize properties into /tmp/LTL7237424893638903947.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/LTL2136532575067215267.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7237424893638903947.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/LTL2136532...266
Read 1 LTL properties
Checking formula 0 : !(((((F("(gu3.ATTENTE_B<=gu3.CONTROLEUR_2)"))&&("(gi2.gu1.SORTI_B<2)"))&&(F("(gu0.NB_ATTENTE_A_13<=gu0.SORTI_A)")))U(G("(gi2.gu1.SORTI...166
Formula 0 simplified : !(("(gi2.gu1.SORTI_B<2)" & F"(gu3.ATTENTE_B<=gu3.CONTROLEUR_2)" & F"(gu0.NB_ATTENTE_A_13<=gu0.SORTI_A)") U G"(gi2.gu1.SORTI_B>=2)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5994876168056427019
[2022-05-15 02:28:25] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5994876168056427019
Running compilation step : cd /tmp/ltsmin5994876168056427019;'/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 1714 ms.
Running link step : cd /tmp/ltsmin5994876168056427019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5994876168056427019;'/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))&&(LTLAPp1==true)&&<>((LTLAPp2==true))) U [](!(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BridgeAndVehicles-PT-V20P10N20-LTLCardinality-09 finished in 63371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U !F(p1))||(F(X(F(p2)))&&F(p3))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 968
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 967
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 967
Applied a total of 4 rules in 8 ms. Remains 75 /78 variables (removed 3) and now considering 967/968 (removed 1) transitions.
[2022-05-15 02:28:40] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:28:40] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:28:41] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
[2022-05-15 02:28:41] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:28:41] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 02:28:41] [INFO ] Implicit Places using invariants in 141 ms returned []
[2022-05-15 02:28:41] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:28:41] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-15 02:28:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:28:41] [INFO ] Implicit Places using invariants and state equation in 391 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 537 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 73/78 places, 967/968 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/78 places, 967/968 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (NOT p2), (NOT p3), (AND (NOT p2) p1), (AND (NOT p3) p1), (AND p1 (NOT p2)), (AND p1 (NOT p3))]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p1 p0 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LEQ s50 s51) (LEQ s50 s1)), p0:(LEQ 1 s47), p3:(LEQ s50 s1), p2:(LEQ s50 s51)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 437 ms.
Product exploration explored 100000 steps with 50000 reset in 444 ms.
Computed a total of 46 stabilizing places and 83 stable transitions
Computed a total of 46 stabilizing places and 83 stable transitions
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p0 (NOT p3)))), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 29 factoid took 528 ms. Reduced automaton from 7 states, 20 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V20P10N20-LTLCardinality-11 finished in 2579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Graph (complete) has 1690 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 75 transition count 967
Applied a total of 3 rules in 50 ms. Remains 75 /78 variables (removed 3) and now considering 967/968 (removed 1) transitions.
[2022-05-15 02:28:43] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:28:43] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 02:28:43] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
[2022-05-15 02:28:43] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:28:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:28:43] [INFO ] Implicit Places using invariants in 151 ms returned []
[2022-05-15 02:28:43] [INFO ] Flow matrix only has 169 transitions (discarded 798 similar events)
// Phase 1: matrix 169 rows 75 cols
[2022-05-15 02:28:43] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 02:28:43] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:28:44] [INFO ] Implicit Places using invariants and state equation in 438 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 592 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/78 places, 967/968 transitions.
Applied a total of 0 rules in 46 ms. Remains 73 /73 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 73/78 places, 967/968 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s22)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N20-LTLCardinality-14 finished in 1036 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(!(G(p0) U p1) U p2)&&F(p3))))'
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2022-05-15 02:28:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:28:44] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-15 02:28:44] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
[2022-05-15 02:28:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:28:44] [INFO ] Computed 7 place invariants in 6 ms
[2022-05-15 02:28:44] [INFO ] Implicit Places using invariants in 136 ms returned []
[2022-05-15 02:28:44] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2022-05-15 02:28:44] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-15 02:28:44] [INFO ] State equation strengthened by 42 read => feed constraints.
[2022-05-15 02:28:45] [INFO ] Implicit Places using invariants and state equation in 490 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 629 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 77/78 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 77/78 places, 968/968 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p3) p2), (OR (NOT p3) p2), true, p2, (NOT p3), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V20P10N20-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(GT s22 s24), p1:(LEQ 1 s74), p0:(LEQ s0 s27), p3:(GT s25 s54)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 3 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V20P10N20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V20P10N20-LTLCardinality-15 finished in 1252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p0)||p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&p1&&F(p2)) U G(!p1)))'
[2022-05-15 02:28:46] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16506246806418155491
[2022-05-15 02:28:46] [INFO ] Computing symmetric may disable matrix : 968 transitions.
[2022-05-15 02:28:46] [INFO ] Applying decomposition
[2022-05-15 02:28:46] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:28:46] [INFO ] Flatten gal took : 29 ms
[2022-05-15 02:28:46] [INFO ] Computing symmetric may enable matrix : 968 transitions.
[2022-05-15 02:28:46] [INFO ] Computation of Complete enable matrix. took 3 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/graph15055785541398318971.txt' '-o' '/tmp/graph15055785541398318971.bin' '-w' '/tmp/graph15055785541398318971.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15055785541398318971.bin' '-l' '-1' '-v' '-w' '/tmp/graph15055785541398318971.weights' '-q' '0' '-e' '0.001'
[2022-05-15 02:28:46] [INFO ] Decomposing Gal with order
[2022-05-15 02:28:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 02:28:46] [INFO ] Computing Do-Not-Accords matrix : 968 transitions.
[2022-05-15 02:28:46] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 02:28:46] [INFO ] Removed a total of 1317 redundant transitions.
[2022-05-15 02:28:46] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16506246806418155491
Running compilation step : cd /tmp/ltsmin16506246806418155491;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' '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 02:28:46] [INFO ] Flatten gal took : 82 ms
[2022-05-15 02:28:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 213 labels/synchronizations in 7 ms.
[2022-05-15 02:28:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality2909500649562269107.gal : 3 ms
[2022-05-15 02:28:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality5293232265300560753.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/LTLCardinality2909500649562269107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5293232265300560753.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...288
Read 2 LTL properties
Checking formula 0 : !((G(F(("(gi2.gu2.ROUTE_A<1)")U((G("(gi2.gu2.ROUTE_A<1)"))||("((gi2.gu2.SUR_PONT_A>1)&&(gi2.gu2.ROUTE_A<1))"))))))
Formula 0 simplified : !GF("(gi2.gu2.ROUTE_A<1)" U ("((gi2.gu2.SUR_PONT_A>1)&&(gi2.gu2.ROUTE_A<1))" | G"(gi2.gu2.ROUTE_A<1)"))
Compilation finished in 3797 ms.
Running link step : cd /tmp/ltsmin16506246806418155491;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin16506246806418155491;'/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' '[](<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 02:49:49] [INFO ] Flatten gal took : 68 ms
[2022-05-15 02:49:49] [INFO ] Time to serialize gal into /tmp/LTLCardinality2846914438598473630.gal : 18 ms
[2022-05-15 02:49:49] [INFO ] Time to serialize properties into /tmp/LTLCardinality17826381464298468645.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/LTLCardinality2846914438598473630.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17826381464298468645.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 2 LTL properties
Checking formula 0 : !((G(F(("(ROUTE_A<1)")U((G("(ROUTE_A<1)"))||("((SUR_PONT_A>1)&&(ROUTE_A<1))"))))))
Formula 0 simplified : !GF("(ROUTE_A<1)" U ("((SUR_PONT_A>1)&&(ROUTE_A<1))" | G"(ROUTE_A<1)"))
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin16506246806418155491;'/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' '[](<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16506246806418155491;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp2==true))&&(LTLAPp3==true)&&<>((LTLAPp4==true))) U [](!(LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 03:10:52] [INFO ] Flatten gal took : 106 ms
[2022-05-15 03:10:52] [INFO ] Input system was already deterministic with 968 transitions.
[2022-05-15 03:10:52] [INFO ] Transformed 78 places.
[2022-05-15 03:10:52] [INFO ] Transformed 968 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 03:10:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality4444643228172383842.gal : 5 ms
[2022-05-15 03:10:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality600452986473403999.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/LTLCardinality4444643228172383842.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality600452986473403999.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...332
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(ROUTE_A<1)")U((G("(ROUTE_A<1)"))||("((SUR_PONT_A>1)&&(ROUTE_A<1))"))))))
Formula 0 simplified : !GF("(ROUTE_A<1)" U ("((SUR_PONT_A>1)&&(ROUTE_A<1))" | G"(ROUTE_A<1)"))
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-V20P10N20"
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-V20P10N20, 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-165251918200187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N20.tgz
mv BridgeAndVehicles-PT-V20P10N20 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 ;