Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r065-tajo-171620414400102.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is BridgeAndVehicles-PT-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414400102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.8K Apr 13 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 01:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 13 01:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 13 01:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 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-V04P05N02-LTLCardinality-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716629859388

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-25 09:37:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 09:37:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:37:41] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2024-05-25 09:37:41] [INFO ] Transformed 28 places.
[2024-05-25 09:37:41] [INFO ] Transformed 52 transitions.
[2024-05-25 09:37:41] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 10 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:37:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2024-05-25 09:37:41] [INFO ] Computed 7 invariants in 8 ms
[2024-05-25 09:37:41] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
[2024-05-25 09:37:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:41] [INFO ] Invariant cache hit.
[2024-05-25 09:37:41] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-25 09:37:41] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:41] [INFO ] Invariant cache hit.
[2024-05-25 09:37:41] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:41] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 108 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 27/28 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 315 ms. Remains : 27/28 places, 52/52 transitions.
Support contains 17 out of 27 places after structural reductions.
[2024-05-25 09:37:42] [INFO ] Flatten gal took : 23 ms
[2024-05-25 09:37:42] [INFO ] Flatten gal took : 9 ms
[2024-05-25 09:37:42] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-25 09:37:42] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2024-05-25 09:37:42] [INFO ] Computed 6 invariants in 2 ms
[2024-05-25 09:37:42] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2024-05-25 09:37:42] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2024-05-25 09:37:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-25 09:37:42] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2024-05-25 09:37:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:42] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2024-05-25 09:37:42] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-25 09:37:42] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 134 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 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 24 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 24 transition count 51
Applied a total of 3 rules in 9 ms. Remains 24 /27 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:37:42] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2024-05-25 09:37:42] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 09:37:42] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 24/27 places, 51/52 transitions.
Incomplete random walk after 10000 steps, including 230 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 38 ms. (steps per millisecond=264 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 10 ms. (steps per millisecond=1003 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 18 stabilizing places and 20 stable transitions
Graph (complete) has 202 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 202 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 24 transition count 51
Applied a total of 3 rules in 10 ms. Remains 24 /27 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:37:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2024-05-25 09:37:43] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:37:43] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
[2024-05-25 09:37:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:43] [INFO ] Invariant cache hit.
[2024-05-25 09:37:43] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-25 09:37:43] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:43] [INFO ] Invariant cache hit.
[2024-05-25 09:37:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:43] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/27 places, 51/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 23/27 places, 51/52 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04 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 1 s16)], 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 6291 reset in 260 ms.
Product exploration explored 100000 steps with 6290 reset in 189 ms.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
[2024-05-25 09:37:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 23 cols
[2024-05-25 09:37:44] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 09:37:44] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:37:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 09:37:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:37:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:37:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:37:44] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 09:37:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:44] [INFO ] [Nat]Added 6 Read/Feed constraints in 9 ms returned sat
[2024-05-25 09:37:44] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 5 ms.
[2024-05-25 09:37:45] [INFO ] Added : 12 causal constraints over 3 iterations in 38 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 09:37:45] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:45] [INFO ] Invariant cache hit.
[2024-05-25 09:37:45] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2024-05-25 09:37:45] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:45] [INFO ] Invariant cache hit.
[2024-05-25 09:37:45] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-25 09:37:45] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:45] [INFO ] Invariant cache hit.
[2024-05-25 09:37:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:45] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-25 09:37:45] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 09:37:45] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:45] [INFO ] Invariant cache hit.
[2024-05-25 09:37:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 23/23 places, 51/51 transitions.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
[2024-05-25 09:37:45] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:45] [INFO ] Invariant cache hit.
[2024-05-25 09:37:45] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:37:45] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 09:37:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:37:45] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:37:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:37:45] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 09:37:45] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:45] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-05-25 09:37:45] [INFO ] Computed and/alt/rep : 24/79/24 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-25 09:37:46] [INFO ] Added : 15 causal constraints over 4 iterations in 28 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6318 reset in 129 ms.
Product exploration explored 100000 steps with 6324 reset in 94 ms.
Built C files in :
/tmp/ltsmin9420031283401723610
[2024-05-25 09:37:46] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-25 09:37:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:37:46] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-25 09:37:46] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:37:46] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-25 09:37:46] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:37:46] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9420031283401723610
Running compilation step : cd /tmp/ltsmin9420031283401723610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 326 ms.
Running link step : cd /tmp/ltsmin9420031283401723610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin9420031283401723610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13516420404079972115.hoa' '--buchi-type=spotba'
LTSmin run took 247 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-04 finished in 3785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 202 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 25 transition count 51
Applied a total of 3 rules in 6 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 09:37:47] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 09:37:47] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:47] [INFO ] Invariant cache hit.
[2024-05-25 09:37:47] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:47] [INFO ] Invariant cache hit.
[2024-05-25 09:37:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:47] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 104 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 51/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 155 ms. Remains : 24/27 places, 51/52 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 (ADD s16 s17)), p1:(GT 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 176 steps with 23 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-07 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 24 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 51
Applied a total of 4 rules in 3 ms. Remains 24 /27 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2024-05-25 09:37:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:37:47] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:47] [INFO ] Invariant cache hit.
[2024-05-25 09:37:47] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:47] [INFO ] Invariant cache hit.
[2024-05-25 09:37:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:47] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:47] [INFO ] Invariant cache hit.
[2024-05-25 09:37:47] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/27 places, 51/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 24/27 places, 51/52 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08 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 s0 s6)], 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 4 steps with 0 reset in 0 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-08 finished in 347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 4 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 24 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 24 transition count 51
Applied a total of 4 rules in 2 ms. Remains 24 /27 variables (removed 3) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:47] [INFO ] Invariant cache hit.
[2024-05-25 09:37:47] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:47] [INFO ] Invariant cache hit.
[2024-05-25 09:37:47] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 09:37:47] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:37:47] [INFO ] Invariant cache hit.
[2024-05-25 09:37:47] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:47] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 123 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/27 places, 51/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 181 ms. Remains : 23/27 places, 51/52 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s9 s17), p0:(LEQ s5 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Computed a total of 14 stabilizing places and 19 stable transitions
Computed a total of 14 stabilizing places and 19 stable transitions
Detected a total of 14/23 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 29 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-09 finished in 701 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&X(p1))))))'
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Applied a total of 1 rules in 2 ms. Remains 26 /27 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:37:48] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:37:48] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 09:37:48] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2024-05-25 09:37:48] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:48] [INFO ] Invariant cache hit.
[2024-05-25 09:37:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-25 09:37:48] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:48] [INFO ] Invariant cache hit.
[2024-05-25 09:37:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:48] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-25 09:37:48] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:48] [INFO ] Invariant cache hit.
[2024-05-25 09:37:48] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 26/27 places, 52/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 26/27 places, 52/52 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 s7), p1:(LEQ s6 s8)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11452 reset in 166 ms.
Product exploration explored 100000 steps with 11323 reset in 136 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 201 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/26 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:50] [INFO ] Invariant cache hit.
[2024-05-25 09:37:50] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-25 09:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:50] [INFO ] Invariant cache hit.
[2024-05-25 09:37:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-25 09:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:50] [INFO ] Invariant cache hit.
[2024-05-25 09:37:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:50] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-25 09:37:50] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:50] [INFO ] Invariant cache hit.
[2024-05-25 09:37:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 26/26 places, 52/52 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 201 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/26 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 245 steps, including 5 resets, run visited all 3 properties in 6 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 267 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11319 reset in 150 ms.
Product exploration explored 100000 steps with 11327 reset in 147 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 313 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 11 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:37:52] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:37:52] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 09:37:53] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
[2024-05-25 09:37:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 09:37:53] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:53] [INFO ] Invariant cache hit.
[2024-05-25 09:37:53] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 52/52 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 26/26 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin11452472886038724694
[2024-05-25 09:37:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11452472886038724694
Running compilation step : cd /tmp/ltsmin11452472886038724694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 166 ms.
Running link step : cd /tmp/ltsmin11452472886038724694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin11452472886038724694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13020035414762534509.hoa' '--buchi-type=spotba'
LTSmin run took 751 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-10 finished in 5677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1 U p2))))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:37:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:37:54] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:37:54] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
[2024-05-25 09:37:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:54] [INFO ] Invariant cache hit.
[2024-05-25 09:37:54] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-25 09:37:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:54] [INFO ] Invariant cache hit.
[2024-05-25 09:37:54] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:54] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-25 09:37:54] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:54] [INFO ] Invariant cache hit.
[2024-05-25 09:37:54] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 26/27 places, 52/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 26/27 places, 52/52 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ s9 s21), p2:(GT s6 s0), p1:(GT 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 31873 reset in 131 ms.
Product exploration explored 100000 steps with 31652 reset in 132 ms.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 201 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/26 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))))]
Knowledge based reduction with 4 factoid took 619 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-25 09:37:55] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:55] [INFO ] Invariant cache hit.
[2024-05-25 09:37:55] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 09:37:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:37:55] [INFO ] After 32ms SMT Verify possible using all constraints in natural 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (F (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))), (F (AND (NOT p2) (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 536 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 26 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:37:56] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:56] [INFO ] Invariant cache hit.
[2024-05-25 09:37:56] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-25 09:37:56] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:56] [INFO ] Invariant cache hit.
[2024-05-25 09:37:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-25 09:37:56] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:56] [INFO ] Invariant cache hit.
[2024-05-25 09:37:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:37:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-25 09:37:56] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:56] [INFO ] Invariant cache hit.
[2024-05-25 09:37:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 26/26 places, 52/52 transitions.
Computed a total of 17 stabilizing places and 20 stable transitions
Graph (complete) has 201 edges and 26 vertex of which 25 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 20 stable transitions
Detected a total of 17/26 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 341 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 587 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 31772 reset in 151 ms.
Product exploration explored 100000 steps with 31849 reset in 147 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 52/52 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 7 ms. Remains 26 /26 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:37:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:37:59] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 09:37:59] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2024-05-25 09:37:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 09:37:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:59] [INFO ] Invariant cache hit.
[2024-05-25 09:37:59] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/26 places, 52/52 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 26/26 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin5841549416137228034
[2024-05-25 09:37:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5841549416137228034
Running compilation step : cd /tmp/ltsmin5841549416137228034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin5841549416137228034;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5841549416137228034;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2782084481378859251.hoa' '--buchi-type=spotba'
LTSmin run took 353 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-11 finished in 5766 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||X(G(p1)))))))'
Support contains 5 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:37:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2024-05-25 09:37:59] [INFO ] Computed 6 invariants in 0 ms
[2024-05-25 09:37:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-25 09:37:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:59] [INFO ] Invariant cache hit.
[2024-05-25 09:37:59] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-25 09:37:59] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:37:59] [INFO ] Invariant cache hit.
[2024-05-25 09:37:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/27 places, 52/52 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 25/27 places, 52/52 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GT s7 s6) (GT 2 s8)), p1:(LEQ s18 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7791 reset in 240 ms.
Product exploration explored 100000 steps with 7772 reset in 145 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Graph (complete) has 189 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 20 stable transitions
Detected a total of 16/25 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 293 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
Finished random walk after 227 steps, including 5 resets, run visited all 5 properties in 19 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 694 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 298 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
[2024-05-25 09:38:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 25 cols
[2024-05-25 09:38:02] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:38:02] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-25 09:38:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:38:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:38:02] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 09:38:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2024-05-25 09:38:02] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 2 ms to minimize.
[2024-05-25 09:38:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-25 09:38:02] [INFO ] Computed and/alt/rep : 25/83/25 causal constraints (skipped 6 transitions) in 3 ms.
[2024-05-25 09:38:02] [INFO ] Added : 11 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 52/52 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-25 09:38:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:02] [INFO ] Invariant cache hit.
[2024-05-25 09:38:02] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-25 09:38:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:02] [INFO ] Invariant cache hit.
[2024-05-25 09:38:02] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 09:38:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:02] [INFO ] Invariant cache hit.
[2024-05-25 09:38:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:02] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-25 09:38:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 09:38:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:02] [INFO ] Invariant cache hit.
[2024-05-25 09:38:02] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 25/25 places, 52/52 transitions.
Computed a total of 16 stabilizing places and 20 stable transitions
Graph (complete) has 189 edges and 25 vertex of which 24 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 16 stabilizing places and 20 stable transitions
Detected a total of 16/25 stabilizing places and 20/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 342 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
Finished random walk after 141 steps, including 3 resets, run visited all 5 properties in 2 ms. (steps per millisecond=70 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 13 factoid took 894 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 268 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
[2024-05-25 09:38:05] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2024-05-25 09:38:05] [INFO ] Invariant cache hit.
[2024-05-25 09:38:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:38:05] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 09:38:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:38:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 09:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:38:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 09:38:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:05] [INFO ] [Nat]Added 6 Read/Feed constraints in 7 ms returned sat
[2024-05-25 09:38:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
[2024-05-25 09:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-25 09:38:05] [INFO ] Computed and/alt/rep : 25/83/25 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-25 09:38:05] [INFO ] Added : 11 causal constraints over 3 iterations in 127 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false]
Product exploration explored 100000 steps with 7743 reset in 137 ms.
Product exploration explored 100000 steps with 7756 reset in 158 ms.
Built C files in :
/tmp/ltsmin1850564122676383483
[2024-05-25 09:38:05] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-05-25 09:38:05] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:05] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-05-25 09:38:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:05] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-05-25 09:38:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:05] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1850564122676383483
Running compilation step : cd /tmp/ltsmin1850564122676383483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 192 ms.
Running link step : cd /tmp/ltsmin1850564122676383483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin1850564122676383483;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13338524697012013094.hoa' '--buchi-type=spotba'
LTSmin run took 145 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-12 finished in 6447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 202 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 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 25 transition count 51
Applied a total of 3 rules in 4 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2024-05-25 09:38:06] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-05-25 09:38:06] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
[2024-05-25 09:38:06] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:06] [INFO ] Invariant cache hit.
[2024-05-25 09:38:06] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-25 09:38:06] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:06] [INFO ] Invariant cache hit.
[2024-05-25 09:38:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 101 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/27 places, 51/52 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 24/27 places, 51/52 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GT 2 s19) (GT 2 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2590 reset in 114 ms.
Product exploration explored 100000 steps with 2591 reset in 129 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Graph (complete) has 187 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 19 stable transitions
Detected a total of 15/24 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Finished random walk after 1575 steps, including 40 resets, run visited all 1 properties in 4 ms. (steps per millisecond=393 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 51/51 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2024-05-25 09:38:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 24 cols
[2024-05-25 09:38:07] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:38:07] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2024-05-25 09:38:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:07] [INFO ] Invariant cache hit.
[2024-05-25 09:38:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-25 09:38:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:07] [INFO ] Invariant cache hit.
[2024-05-25 09:38:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-25 09:38:07] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-25 09:38:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 09:38:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-25 09:38:07] [INFO ] Invariant cache hit.
[2024-05-25 09:38:07] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 24/24 places, 51/51 transitions.
Computed a total of 15 stabilizing places and 19 stable transitions
Graph (complete) has 187 edges and 24 vertex of which 23 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 15 stabilizing places and 19 stable transitions
Detected a total of 15/24 stabilizing places and 19/51 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 1764 steps, including 45 resets, run visited all 1 properties in 4 ms. (steps per millisecond=441 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2590 reset in 115 ms.
Product exploration explored 100000 steps with 2588 reset in 128 ms.
Built C files in :
/tmp/ltsmin10365438550054985278
[2024-05-25 09:38:08] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2024-05-25 09:38:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:08] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2024-05-25 09:38:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:08] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2024-05-25 09:38:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 09:38:08] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10365438550054985278
Running compilation step : cd /tmp/ltsmin10365438550054985278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 187 ms.
Running link step : cd /tmp/ltsmin10365438550054985278;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10365438550054985278;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13159760166398942954.hoa' '--buchi-type=spotba'
LTSmin run took 200 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BridgeAndVehicles-PT-V04P05N02-LTLCardinality-14 finished in 2336 ms.
All properties solved by simple procedures.
Total runtime 27362 ms.

BK_STOP 1716629888893

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-V04P05N02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is BridgeAndVehicles-PT-V04P05N02, 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 r065-tajo-171620414400102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V04P05N02.tgz
mv BridgeAndVehicles-PT-V04P05N02 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 ;