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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 13K Apr 29 21:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 29 21:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 29 21:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 29 21:18 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 5.1K May 9 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 9 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K May 9 07:06 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 223K 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-V10P10N10-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652578775699

Running Version 202205111006
[2022-05-15 01:39:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 01:39:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 01:39:37] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2022-05-15 01:39:37] [INFO ] Transformed 48 places.
[2022-05-15 01:39:37] [INFO ] Transformed 288 transitions.
[2022-05-15 01:39:37] [INFO ] Parsed PT model containing 48 places and 288 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 13 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2022-05-15 01:39:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2022-05-15 01:39:37] [INFO ] Computed 7 place invariants in 10 ms
[2022-05-15 01:39:37] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
[2022-05-15 01:39:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2022-05-15 01:39:37] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-15 01:39:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2022-05-15 01:39:37] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2022-05-15 01:39:37] [INFO ] Computed 7 place invariants in 4 ms
[2022-05-15 01:39:37] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:39:37] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 249 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/48 places, 288/288 transitions.
Applied a total of 0 rules in 9 ms. Remains 47 /47 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/48 places, 288/288 transitions.
Support contains 13 out of 47 places after structural reductions.
[2022-05-15 01:39:37] [INFO ] Flatten gal took : 52 ms
[2022-05-15 01:39:37] [INFO ] Flatten gal took : 24 ms
[2022-05-15 01:39:38] [INFO ] Input system was already deterministic with 288 transitions.
Finished random walk after 60 steps, including 0 resets, run visited all 15 properties in 19 ms. (steps per millisecond=3 )
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 30 stabilizing places and 44 stable transitions
Graph (complete) has 646 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 288/288 transitions.
Graph (complete) has 646 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 46 /47 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2022-05-15 01:39:38] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:39:38] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:39:38] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
[2022-05-15 01:39:38] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:39:38] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 01:39:38] [INFO ] Implicit Places using invariants in 70 ms returned []
[2022-05-15 01:39:38] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:39:38] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 01:39:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:39:38] [INFO ] Implicit Places using invariants and state equation in 144 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 217 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/47 places, 288/288 transitions.
Applied a total of 0 rules in 22 ms. Remains 45 /45 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 45/47 places, 288/288 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s32 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 6 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-01 finished in 594 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 44 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 287
Applied a total of 4 rules in 10 ms. Remains 44 /47 variables (removed 3) and now considering 287/288 (removed 1) transitions.
[2022-05-15 01:39:38] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:38] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:38] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
[2022-05-15 01:39:38] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:38] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:39:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-05-15 01:39:39] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:39] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:39:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:39:39] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 197 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 43/47 places, 287/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 43 /43 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 43/47 places, 287/288 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s31 (ADD s27 s28))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 2 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-04 finished in 496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(p1))))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 288
Applied a total of 2 rules in 5 ms. Remains 45 /47 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2022-05-15 01:39:39] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:39:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:39] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
[2022-05-15 01:39:39] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:39:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-05-15 01:39:39] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:39:39] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:39:39] [INFO ] Implicit Places using invariants and state equation in 141 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 212 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 44/47 places, 288/288 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s32 s12), p0:(GT s28 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-08 finished in 487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(G(p0))&&F(p1)))&&p1)))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 288
Applied a total of 2 rules in 11 ms. Remains 45 /47 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2022-05-15 01:39:39] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:39:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:39:39] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
[2022-05-15 01:39:39] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:39:39] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:39:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2022-05-15 01:39:40] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:39:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:39:40] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2022-05-15 01:39:40] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:39:40] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:40] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/47 places, 288/288 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/47 places, 288/288 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 2 s27), p0:(LEQ s27 s30)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1179 reset in 319 ms.
Product exploration explored 100000 steps with 1182 reset in 231 ms.
Computed a total of 28 stabilizing places and 44 stable transitions
Computed a total of 28 stabilizing places and 44 stable transitions
Detected a total of 28/45 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 358 ms. Reduced automaton from 6 states, 11 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 288/288 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 44 transition count 287
Applied a total of 2 rules in 44 ms. Remains 44 /45 variables (removed 1) and now considering 287/288 (removed 1) transitions.
[2022-05-15 01:39:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:42] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
[2022-05-15 01:39:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:42] [INFO ] Implicit Places using invariants in 65 ms returned []
[2022-05-15 01:39:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:42] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:39:42] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2022-05-15 01:39:42] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-15 01:39:42] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:42] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:39:42] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/45 places, 287/288 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/45 places, 287/288 transitions.
Computed a total of 27 stabilizing places and 43 stable transitions
Computed a total of 27 stabilizing places and 43 stable transitions
Detected a total of 27/44 stabilizing places and 43/287 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 322 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 p1), (X p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 343 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1336 reset in 284 ms.
Product exploration explored 100000 steps with 1333 reset in 325 ms.
Built C files in :
/tmp/ltsmin14504540197906964770
[2022-05-15 01:39:44] [INFO ] Computing symmetric may disable matrix : 287 transitions.
[2022-05-15 01:39:44] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:39:44] [INFO ] Computing symmetric may enable matrix : 287 transitions.
[2022-05-15 01:39:44] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:39:44] [INFO ] Computing Do-Not-Accords matrix : 287 transitions.
[2022-05-15 01:39:44] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:39:44] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14504540197906964770
Running compilation step : cd /tmp/ltsmin14504540197906964770;'/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 753 ms.
Running link step : cd /tmp/ltsmin14504540197906964770;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14504540197906964770;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4119802139002101750.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 17 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2022-05-15 01:39:59] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:59] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
[2022-05-15 01:39:59] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:59] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-15 01:39:59] [INFO ] Implicit Places using invariants in 69 ms returned []
[2022-05-15 01:39:59] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:39:59] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:39:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:39:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2022-05-15 01:39:59] [INFO ] Redundant transitions in 6 ms returned []
[2022-05-15 01:39:59] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:40:00] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:40:00] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 287/287 transitions.
Built C files in :
/tmp/ltsmin399245070636253076
[2022-05-15 01:40:00] [INFO ] Computing symmetric may disable matrix : 287 transitions.
[2022-05-15 01:40:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:40:00] [INFO ] Computing symmetric may enable matrix : 287 transitions.
[2022-05-15 01:40:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:40:00] [INFO ] Computing Do-Not-Accords matrix : 287 transitions.
[2022-05-15 01:40:00] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:40:00] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin399245070636253076
Running compilation step : cd /tmp/ltsmin399245070636253076;'/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 653 ms.
Running link step : cd /tmp/ltsmin399245070636253076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin399245070636253076;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12674919380931897427.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 01:40:15] [INFO ] Flatten gal took : 20 ms
[2022-05-15 01:40:15] [INFO ] Flatten gal took : 18 ms
[2022-05-15 01:40:15] [INFO ] Time to serialize gal into /tmp/LTL7811811684744797552.gal : 5 ms
[2022-05-15 01:40:15] [INFO ] Time to serialize properties into /tmp/LTL14382056742860949502.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/LTL7811811684744797552.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14382056742860949502.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/LTL7811811...267
Read 1 LTL properties
Checking formula 0 : !((X((G((F(G("(ATTENTE_B<=SUR_PONT_B)")))&&(F("(ATTENTE_B<2)"))))&&("(ATTENTE_B<2)"))))
Formula 0 simplified : !X("(ATTENTE_B<2)" & G(FG"(ATTENTE_B<=SUR_PONT_B)" & F"(ATTENTE_B<2)"))
Reverse transition relation is NOT exact ! Due to transitions t0, t22, t23, t24, t25, t56, t57, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t70, t71,...1399
Computing Next relation with stutter on 20 deadlock states
Detected timeout of ITS tools.
[2022-05-15 01:40:30] [INFO ] Flatten gal took : 16 ms
[2022-05-15 01:40:30] [INFO ] Applying decomposition
[2022-05-15 01:40:30] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8773816609133867307.txt' '-o' '/tmp/graph8773816609133867307.bin' '-w' '/tmp/graph8773816609133867307.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8773816609133867307.bin' '-l' '-1' '-v' '-w' '/tmp/graph8773816609133867307.weights' '-q' '0' '-e' '0.001'
[2022-05-15 01:40:30] [INFO ] Decomposing Gal with order
[2022-05-15 01:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 01:40:30] [INFO ] Removed a total of 244 redundant transitions.
[2022-05-15 01:40:30] [INFO ] Flatten gal took : 88 ms
[2022-05-15 01:40:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 5 ms.
[2022-05-15 01:40:30] [INFO ] Time to serialize gal into /tmp/LTL14742881234804477828.gal : 3 ms
[2022-05-15 01:40:30] [INFO ] Time to serialize properties into /tmp/LTL6563101427498677719.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/LTL14742881234804477828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6563101427498677719.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/LTL1474288...267
Read 1 LTL properties
Checking formula 0 : !((X((G((F(G("(gu0.ATTENTE_B<=gu0.SUR_PONT_B)")))&&(F("(gu0.ATTENTE_B<2)"))))&&("(gu0.ATTENTE_B<2)"))))
Formula 0 simplified : !X("(gu0.ATTENTE_B<2)" & G(FG"(gu0.ATTENTE_B<=gu0.SUR_PONT_B)" & F"(gu0.ATTENTE_B<2)"))
Reverse transition relation is NOT exact ! Due to transitions gi1.gu2.t56, gi1.gu2.t59, gi1.gu2.t60, gi1.gu2.t61, gi1.gu2.t62, gi1.gu2.t63, gi1.gu2.t64, gi...1631
Computing Next relation with stutter on 20 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11376151323671678241
[2022-05-15 01:40:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11376151323671678241
Running compilation step : cd /tmp/ltsmin11376151323671678241;'/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 463 ms.
Running link step : cd /tmp/ltsmin11376151323671678241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11376151323671678241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))&&(LTLAPp1==true)))' '--buchi-type=spotba'
LTSmin run took 3956 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-09 finished in 70391 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(p0))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 288/288 transitions.
Graph (complete) has 646 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 44 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 44 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 42 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 41 transition count 285
Applied a total of 8 rules in 35 ms. Remains 41 /47 variables (removed 6) and now considering 285/288 (removed 3) transitions.
[2022-05-15 01:40:50] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
// Phase 1: matrix 87 rows 41 cols
[2022-05-15 01:40:50] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:40:50] [INFO ] Implicit Places using invariants in 74 ms returned []
[2022-05-15 01:40:50] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
// Phase 1: matrix 87 rows 41 cols
[2022-05-15 01:40:50] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-15 01:40:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:40:50] [INFO ] Implicit Places using invariants and state equation in 152 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 229 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/47 places, 285/288 transitions.
Applied a total of 0 rules in 12 ms. Remains 40 /40 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 40/47 places, 285/288 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s33 s26)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3074 reset in 149 ms.
Product exploration explored 100000 steps with 3063 reset in 159 ms.
Computed a total of 24 stabilizing places and 42 stable transitions
Computed a total of 24 stabilizing places and 42 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 285/285 transitions.
Applied a total of 0 rules in 15 ms. Remains 40 /40 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2022-05-15 01:40:51] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
// Phase 1: matrix 87 rows 40 cols
[2022-05-15 01:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:40:51] [INFO ] Implicit Places using invariants in 60 ms returned []
[2022-05-15 01:40:51] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
// Phase 1: matrix 87 rows 40 cols
[2022-05-15 01:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:40:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:40:51] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2022-05-15 01:40:51] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-15 01:40:51] [INFO ] Flow matrix only has 87 transitions (discarded 198 similar events)
// Phase 1: matrix 87 rows 40 cols
[2022-05-15 01:40:51] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-15 01:40:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 285/285 transitions.
Computed a total of 24 stabilizing places and 42 stable transitions
Computed a total of 24 stabilizing places and 42 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3074 reset in 156 ms.
Stuttering criterion allowed to conclude after 17086 steps with 514 reset in 27 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-10 finished in 2069 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||(p1 U (p2||G(p1)))))))'
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 288/288 transitions.
Graph (complete) has 646 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 46 /47 variables (removed 1) and now considering 288/288 (removed 0) transitions.
[2022-05-15 01:40:52] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:40:52] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
[2022-05-15 01:40:52] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:40:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2022-05-15 01:40:52] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:52] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:40:52] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:40:52] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2022-05-15 01:40:52] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-15 01:40:52] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:52] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 01:40:52] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/47 places, 288/288 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/47 places, 288/288 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(AND (LEQ 2 s28) (GT s31 s13)), p1:(LEQ 2 s28), p0:(LEQ s31 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1154 reset in 237 ms.
Product exploration explored 100000 steps with 1154 reset in 233 ms.
Computed a total of 29 stabilizing places and 44 stable transitions
Graph (complete) has 645 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 29 stabilizing places and 44 stable transitions
Detected a total of 29/46 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (OR p0 p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 14 factoid took 534 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 2 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 110 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-15 01:40:53] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:53] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:40:54] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (OR p0 p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (NOT (OR p2 p0))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2)]
Knowledge based reduction with 15 factoid took 712 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 288/288 transitions.
Applied a total of 0 rules in 12 ms. Remains 46 /46 variables (removed 0) and now considering 288/288 (removed 0) transitions.
[2022-05-15 01:40:54] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:54] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:40:54] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
[2022-05-15 01:40:54] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:54] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-15 01:40:55] [INFO ] Implicit Places using invariants in 58 ms returned []
[2022-05-15 01:40:55] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:40:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:40:55] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-05-15 01:40:55] [INFO ] Redundant transitions in 2 ms returned []
[2022-05-15 01:40:55] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 46 cols
[2022-05-15 01:40:55] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:40:55] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 46/46 places, 288/288 transitions.
Computed a total of 29 stabilizing places and 44 stable transitions
Graph (complete) has 645 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 29 stabilizing places and 44 stable transitions
Detected a total of 29/46 stabilizing places and 44/288 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 226 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 585 steps, including 6 resets, run visited all 2 properties in 26 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (OR p0 p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR p0 p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 7 factoid took 420 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1153 reset in 192 ms.
Product exploration explored 100000 steps with 1153 reset in 200 ms.
Built C files in :
/tmp/ltsmin9593698377240960761
[2022-05-15 01:40:56] [INFO ] Computing symmetric may disable matrix : 288 transitions.
[2022-05-15 01:40:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:40:56] [INFO ] Computing symmetric may enable matrix : 288 transitions.
[2022-05-15 01:40:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:40:56] [INFO ] Computing Do-Not-Accords matrix : 288 transitions.
[2022-05-15 01:40:56] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:40:56] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9593698377240960761
Running compilation step : cd /tmp/ltsmin9593698377240960761;'/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 657 ms.
Running link step : cd /tmp/ltsmin9593698377240960761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9593698377240960761;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13245746376654665875.hoa' '--buchi-type=spotba'
LTSmin run took 12483 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-11 finished in 17445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((p0 U G(p1))) U p2)&&p1)))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 288/288 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 45 transition count 288
Applied a total of 2 rules in 2 ms. Remains 45 /47 variables (removed 2) and now considering 288/288 (removed 0) transitions.
[2022-05-15 01:41:09] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:41:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:41:09] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
[2022-05-15 01:41:09] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:41:09] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:41:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2022-05-15 01:41:09] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 45 cols
[2022-05-15 01:41:09] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-15 01:41:09] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:41:10] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 177 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 288/288 transitions.
Applied a total of 0 rules in 8 ms. Remains 44 /44 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 44/47 places, 288/288 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s0), p2:(LEQ s13 s32), p0:(LEQ s29 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 60 steps with 3 reset in 1 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-12 finished in 492 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(!(F(p0) U X(G(p1))))))'
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 288/288 transitions.
Graph (complete) has 646 edges and 47 vertex of which 46 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 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 287
Applied a total of 3 rules in 19 ms. Remains 45 /47 variables (removed 2) and now considering 287/288 (removed 1) transitions.
[2022-05-15 01:41:10] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-15 01:41:10] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:41:10] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
[2022-05-15 01:41:10] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-15 01:41:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:41:10] [INFO ] Implicit Places using invariants in 57 ms returned []
[2022-05-15 01:41:10] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 45 cols
[2022-05-15 01:41:10] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:41:10] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:41:10] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 201 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/47 places, 287/288 transitions.
Applied a total of 0 rules in 18 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 44/47 places, 287/288 transitions.
Stuttering acceptance computed with spot in 57 ms :[p1, p1]
Running random walk in product with property : BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LEQ 3 s12) (LEQ s13 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5284 reset in 165 ms.
Product exploration explored 100000 steps with 5143 reset in 175 ms.
Computed a total of 27 stabilizing places and 43 stable transitions
Graph (complete) has 619 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 43 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[p1, p1]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Stuttering acceptance computed with spot in 60 ms :[p1, p1]
[2022-05-15 01:41:11] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:41:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:41:11] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:41:11] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 01:41:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:41:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:41:11] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-05-15 01:41:11] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:41:11] [INFO ] [Nat]Added 22 Read/Feed constraints in 27 ms returned sat
[2022-05-15 01:41:11] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2022-05-15 01:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-15 01:41:11] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 23 ms.
[2022-05-15 01:41:11] [INFO ] Added : 13 causal constraints over 4 iterations in 61 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 287/287 transitions.
Applied a total of 0 rules in 7 ms. Remains 44 /44 variables (removed 0) and now considering 287/287 (removed 0) transitions.
[2022-05-15 01:41:11] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:41:11] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:41:12] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
[2022-05-15 01:41:12] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:41:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:41:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2022-05-15 01:41:12] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:41:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:41:12] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:41:12] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2022-05-15 01:41:12] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-15 01:41:12] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:41:12] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 01:41:12] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 287/287 transitions.
Computed a total of 27 stabilizing places and 43 stable transitions
Graph (complete) has 619 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 43 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[p1, p1]
Stuttering acceptance computed with spot in 55 ms :[p1, p1]
[2022-05-15 01:41:12] [INFO ] Flow matrix only has 89 transitions (discarded 198 similar events)
// Phase 1: matrix 89 rows 44 cols
[2022-05-15 01:41:12] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 01:41:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:41:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 01:41:13] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-15 01:41:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 01:41:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-15 01:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 01:41:13] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-15 01:41:13] [INFO ] State equation strengthened by 22 read => feed constraints.
[2022-05-15 01:41:13] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2022-05-15 01:41:13] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2022-05-15 01:41:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-15 01:41:13] [INFO ] Computed and/alt/rep : 30/58/30 causal constraints (skipped 56 transitions) in 15 ms.
[2022-05-15 01:41:13] [INFO ] Added : 13 causal constraints over 4 iterations in 62 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 52 ms :[p1, p1]
Product exploration explored 100000 steps with 5097 reset in 171 ms.
Product exploration explored 100000 steps with 5227 reset in 206 ms.
Built C files in :
/tmp/ltsmin10408231579407605775
[2022-05-15 01:41:13] [INFO ] Computing symmetric may disable matrix : 287 transitions.
[2022-05-15 01:41:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:41:13] [INFO ] Computing symmetric may enable matrix : 287 transitions.
[2022-05-15 01:41:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:41:13] [INFO ] Computing Do-Not-Accords matrix : 287 transitions.
[2022-05-15 01:41:13] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 01:41:13] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10408231579407605775
Running compilation step : cd /tmp/ltsmin10408231579407605775;'/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 659 ms.
Running link step : cd /tmp/ltsmin10408231579407605775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10408231579407605775;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1385401601785085626.hoa' '--buchi-type=spotba'
LTSmin run took 13235 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V10P10N10-LTLCardinality-13 finished in 17506 ms.
All properties solved by simple procedures.
Total runtime 110884 ms.

BK_STOP 1652578887846

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-V10P10N10"
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-V10P10N10, 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-165251918200171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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