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

About the Execution of ITS-Tools for CANConstruction-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
457.428 19751.00 30658.00 1491.70 TFTFTTFTTFFFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918600483.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 CANConstruction-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918600483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.9K Apr 29 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 9 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 167K 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 CANConstruction-PT-005-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652642185909

Running Version 202205111006
[2022-05-15 19:16:27] [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 19:16:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 19:16:27] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-15 19:16:27] [INFO ] Transformed 112 places.
[2022-05-15 19:16:27] [INFO ] Transformed 140 transitions.
[2022-05-15 19:16:27] [INFO ] Parsed PT model containing 112 places and 140 transitions in 190 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 2 formulas.
FORMULA CANConstruction-PT-005-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 103 transition count 122
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 103 transition count 122
Applied a total of 18 rules in 24 ms. Remains 103 /112 variables (removed 9) and now considering 122/140 (removed 18) transitions.
// Phase 1: matrix 122 rows 103 cols
[2022-05-15 19:16:27] [INFO ] Computed 11 place invariants in 12 ms
[2022-05-15 19:16:27] [INFO ] Implicit Places using invariants in 179 ms returned [12, 26, 40, 54, 68]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 204 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/112 places, 122/140 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 94 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 94 transition count 118
Applied a total of 8 rules in 6 ms. Remains 94 /98 variables (removed 4) and now considering 118/122 (removed 4) transitions.
// Phase 1: matrix 118 rows 94 cols
[2022-05-15 19:16:27] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 19:16:27] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 118 rows 94 cols
[2022-05-15 19:16:27] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-15 19:16:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 94/112 places, 118/140 transitions.
Finished structural reductions, in 2 iterations. Remains : 94/112 places, 118/140 transitions.
Support contains 36 out of 94 places after structural reductions.
[2022-05-15 19:16:28] [INFO ] Flatten gal took : 29 ms
[2022-05-15 19:16:28] [INFO ] Flatten gal took : 12 ms
[2022-05-15 19:16:28] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 35 out of 94 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 477 ms. (steps per millisecond=20 ) properties (out of 27) seen :20
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 118 rows 94 cols
[2022-05-15 19:16:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2022-05-15 19:16:29] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2022-05-15 19:16:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2022-05-15 19:16:29] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2022-05-15 19:16:29] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:29] [INFO ] After 10ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :6 sat :1
[2022-05-15 19:16:29] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-15 19:16:29] [INFO ] After 139ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 94/94 places, 118/118 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 94 transition count 89
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 65 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 64 transition count 88
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 60 place count 64 transition count 83
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 70 place count 59 transition count 83
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 54 transition count 73
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 54 transition count 73
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 82 place count 54 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 52 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 94 place count 47 transition count 66
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 102 place count 43 transition count 73
Applied a total of 102 rules in 32 ms. Remains 43 /94 variables (removed 51) and now considering 73/118 (removed 45) transitions.
Finished structural reductions, in 1 iterations. Remains : 43/94 places, 73/118 transitions.
Incomplete random walk after 10000 steps, including 376 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Probably explored full state space saw : 2567 states, properties seen :0
Probabilistic random walk after 14560 steps, saw 2567 distinct states, run finished after 41 ms. (steps per millisecond=355 ) properties seen :0
Explored full state space saw : 2567 states, properties seen :0
Exhaustive walk after 14560 steps, saw 2567 distinct states, run finished after 19 ms. (steps per millisecond=766 ) properties seen :0
FORMULA CANConstruction-PT-005-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA CANConstruction-PT-005-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 21 stable transitions
FORMULA CANConstruction-PT-005-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(G(p1)||!p0))))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 94 transition count 91
Reduce places removed 27 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 30 rules applied. Total rules applied 57 place count 67 transition count 88
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 64 transition count 88
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 60 place count 64 transition count 83
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 70 place count 59 transition count 83
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 76 place count 53 transition count 71
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 53 transition count 71
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 53 transition count 68
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 88 place count 50 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 96 place count 46 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 106 place count 41 transition count 74
Applied a total of 106 rules in 20 ms. Remains 41 /94 variables (removed 53) and now considering 74/118 (removed 44) transitions.
// Phase 1: matrix 74 rows 41 cols
[2022-05-15 19:16:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:29] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 74 rows 41 cols
[2022-05-15 19:16:29] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 19:16:29] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-15 19:16:29] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-05-15 19:16:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 41 cols
[2022-05-15 19:16:29] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 19:16:29] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/94 places, 74/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/94 places, 74/118 transitions.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s18 s10), p1:(LEQ s16 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 30 steps with 1 reset in 4 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-01 finished in 694 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(!(p0 U (X((p1 U X(X(p2))))&&p3)))))))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 105
Applied a total of 14 rules in 6 ms. Remains 87 /94 variables (removed 7) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:30] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:30] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:30] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:30] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:30] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 19:16:30] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/94 places, 105/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/94 places, 105/118 transitions.
Stuttering acceptance computed with spot in 602 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={1} source=3 dest: 3}, { cond=p3, acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p0 (NOT p3) p1), acceptance={} source=4 dest: 4}, { cond=(AND p3 p1), acceptance={0} source=4 dest: 4}, { cond=p3, acceptance={0, 1} source=4 dest: 5}, { cond=p0, acceptance={1} source=4 dest: 6}], [{ cond=p3, acceptance={0, 1} source=5 dest: 7}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=5 dest: 8}, { cond=(AND p3 p1), acceptance={0} source=5 dest: 8}, { cond=p0, acceptance={1} source=5 dest: 9}], [{ cond=p3, acceptance={0, 1} source=6 dest: 8}, { cond=p0, acceptance={1} source=6 dest: 10}], [{ cond=(AND p3 p2), acceptance={0, 1} source=7 dest: 7}, { cond=(AND p0 (NOT p3) p1 p2), acceptance={} source=7 dest: 8}, { cond=(AND p3 p1 p2), acceptance={0} source=7 dest: 8}, { cond=(AND p0 p2), acceptance={1} source=7 dest: 9}], [{ cond=(AND p0 (NOT p3) p1 p2), acceptance={} source=8 dest: 4}, { cond=(AND p3 p1 p2), acceptance={0} source=8 dest: 4}, { cond=(AND p3 p2), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p0 p2), acceptance={1} source=8 dest: 6}], [{ cond=(AND p3 p2), acceptance={0, 1} source=9 dest: 8}, { cond=(AND p0 p2), acceptance={1} source=9 dest: 10}], [{ cond=(AND p0 p2), acceptance={1} source=10 dest: 3}, { cond=(AND p3 p2), acceptance={0, 1} source=10 dest: 4}]], initial=0, aps=[p0:(LEQ s57 s84), p3:(LEQ 1 s85), p1:(LEQ s14 s74), p2:(LEQ 1 s24)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3415 reset in 226 ms.
Product exploration explored 100000 steps with 3469 reset in 157 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 418 ms. Reduced automaton from 11 states, 27 edges and 4 AP to 11 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 525 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Finished random walk after 2258 steps, including 32 resets, run visited all 8 properties in 52 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (AND p3 p2)), (F (AND p3 p1)), (F (AND p3 p1 p2)), (F (AND p0 (NOT p3) p1 p2)), (F (NOT p0)), (F (AND p0 (NOT p3) p1)), (F p3), (F (AND p0 p2))]
Knowledge based reduction with 2 factoid took 594 ms. Reduced automaton from 11 states, 27 edges and 4 AP to 11 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 533 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Stuttering acceptance computed with spot in 2702 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 105/105 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:36] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:36] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:36] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:36] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:36] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:36] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 105/105 transitions.
Computed a total of 16 stabilizing places and 20 stable transitions
Computed a total of 16 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 374 ms. Reduced automaton from 11 states, 27 edges and 4 AP to 11 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 498 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Finished random walk after 588 steps, including 6 resets, run visited all 8 properties in 16 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (AND p3 p2)), (F (AND p3 p1)), (F (AND p3 p1 p2)), (F (AND p0 (NOT p3) p1 p2)), (F (NOT p0)), (F (AND p0 (NOT p3) p1)), (F p3), (F (AND p0 p2))]
Knowledge based reduction with 2 factoid took 574 ms. Reduced automaton from 11 states, 27 edges and 4 AP to 11 states, 27 edges and 4 AP.
Stuttering acceptance computed with spot in 471 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Stuttering acceptance computed with spot in 1020 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Stuttering acceptance computed with spot in 501 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Product exploration explored 100000 steps with 3486 reset in 106 ms.
Product exploration explored 100000 steps with 3520 reset in 197 ms.
Built C files in :
/tmp/ltsmin7700146777301760324
[2022-05-15 19:16:40] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7700146777301760324
Running compilation step : cd /tmp/ltsmin7700146777301760324;'/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 272 ms.
Running link step : cd /tmp/ltsmin7700146777301760324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin7700146777301760324;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3418921815699172810.hoa' '--buchi-type=spotba'
LTSmin run took 1137 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-005-LTLCardinality-04 finished in 12140 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 94 transition count 87
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 63 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 62 place count 63 transition count 82
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 58 transition count 82
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 52 transition count 70
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 52 transition count 70
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 52 transition count 66
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 48 transition count 66
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 100 place count 44 transition count 62
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 110 place count 39 transition count 72
Applied a total of 110 rules in 12 ms. Remains 39 /94 variables (removed 55) and now considering 72/118 (removed 46) transitions.
// Phase 1: matrix 72 rows 39 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 72 rows 39 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:42] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-15 19:16:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 72 rows 39 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:42] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/94 places, 72/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/94 places, 72/118 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-06 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 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-06 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(!p1)&&p2)))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 90 transition count 110
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 90 transition count 110
Applied a total of 8 rules in 5 ms. Remains 90 /94 variables (removed 4) and now considering 110/118 (removed 8) transitions.
// Phase 1: matrix 110 rows 90 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 110 rows 90 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 19:16:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:42] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 110 rows 90 cols
[2022-05-15 19:16:42] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:42] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/94 places, 110/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/94 places, 110/118 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (OR (NOT p2) p1), p1, p1]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(LEQ s52 s48), p0:(AND (LEQ s52 s48) (LEQ s77 s79)), p1:(GT s37 s86)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT p1)), true, (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 p0)), (X (NOT (AND p2 p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p0 (NOT p1))
Knowledge based reduction with 18 factoid took 799 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CANConstruction-PT-005-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLCardinality-08 finished in 1473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((G(p0)||p0) U p1)))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 105
Applied a total of 14 rules in 4 ms. Remains 87 /94 variables (removed 7) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/94 places, 105/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/94 places, 105/118 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, p1, p1]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s57 s77), p0:(LEQ s9 s82)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 48 steps with 3 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-09 finished in 268 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G((p0 U X(X(p0))))))))'
Support contains 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 105
Applied a total of 14 rules in 7 ms. Remains 87 /94 variables (removed 7) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:44] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/94 places, 105/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/94 places, 105/118 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s84)], 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]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-11 finished in 307 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 87 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 87 transition count 105
Applied a total of 14 rules in 4 ms. Remains 87 /94 variables (removed 7) and now considering 105/118 (removed 13) transitions.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:44] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 87 cols
[2022-05-15 19:16:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:44] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/94 places, 105/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/94 places, 105/118 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-13 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 s39 s64)], 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 1 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-13 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 94 transition count 89
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 65 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 63 transition count 87
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 62 place count 63 transition count 82
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 72 place count 58 transition count 82
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 78 place count 52 transition count 70
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 52 transition count 70
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 52 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 50 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 96 place count 46 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 106 place count 41 transition count 74
Applied a total of 106 rules in 18 ms. Remains 41 /94 variables (removed 53) and now considering 74/118 (removed 44) transitions.
// Phase 1: matrix 74 rows 41 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:45] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 74 rows 41 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:45] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-05-15 19:16:45] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2022-05-15 19:16:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 41 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 19:16:45] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/94 places, 74/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/94 places, 74/118 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s10 s31) (OR (GT 1 s18) (GT 3 s31)))], 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 30 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-14 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 118/118 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 88 transition count 107
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 88 transition count 107
Applied a total of 12 rules in 2 ms. Remains 88 /94 variables (removed 6) and now considering 107/118 (removed 11) transitions.
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:45] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:45] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-05-15 19:16:45] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 107 rows 88 cols
[2022-05-15 19:16:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 19:16:45] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/94 places, 107/118 transitions.
Finished structural reductions, in 1 iterations. Remains : 88/94 places, 107/118 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-15 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:(LEQ s18 s84)], 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 CANConstruction-PT-005-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-15 finished in 287 ms.
All properties solved by simple procedures.
Total runtime 18429 ms.

BK_STOP 1652642205660

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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-165251918600483"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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