Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r229-tall-167856412800107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is IOTPpurchase-PT-C01M01P01D01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856412800107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 11K Feb 25 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 15:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 15:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 63K Mar 5 18:22 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 IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679440914917

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C01M01P01D01
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-21 23:21:56] [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]
[2023-03-21 23:21:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:21:56] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2023-03-21 23:21:56] [INFO ] Transformed 111 places.
[2023-03-21 23:21:56] [INFO ] Transformed 45 transitions.
[2023-03-21 23:21:56] [INFO ] Found NUPN structural information;
[2023-03-21 23:21:56] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 33 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 72 transition count 45
Applied a total of 39 rules in 12 ms. Remains 72 /111 variables (removed 39) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 72 cols
[2023-03-21 23:21:56] [INFO ] Computed 28 place invariants in 8 ms
[2023-03-21 23:21:56] [INFO ] Implicit Places using invariants in 152 ms returned [11, 17, 32, 40, 41, 42, 44, 46, 47]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 181 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/111 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 63/111 places, 45/45 transitions.
Support contains 33 out of 63 places after structural reductions.
[2023-03-21 23:21:56] [INFO ] Flatten gal took : 18 ms
[2023-03-21 23:21:56] [INFO ] Flatten gal took : 7 ms
[2023-03-21 23:21:56] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=28 ) properties (out of 18) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 45 rows 63 cols
[2023-03-21 23:21:57] [INFO ] Computed 19 place invariants in 11 ms
[2023-03-21 23:21:57] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-21 23:21:57] [INFO ] [Real]Absence check using 10 positive and 9 generalized place invariants in 1 ms returned sat
[2023-03-21 23:21:57] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 59 transition count 28
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 41 transition count 26
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 39 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 38 transition count 25
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 42 place count 38 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 64 place count 25 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 64 place count 25 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 68 place count 23 transition count 14
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 83 place count 14 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 13 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 84 place count 13 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 87 place count 11 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 91 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 93 place count 8 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 94 place count 7 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 97 place count 5 transition count 3
Applied a total of 97 rules in 15 ms. Remains 5 /63 variables (removed 58) and now considering 3/45 (removed 42) transitions.
// Phase 1: matrix 3 rows 5 cols
[2023-03-21 23:21:57] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-21 23:21:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-21 23:21:57] [INFO ] Invariant cache hit.
[2023-03-21 23:21:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-21 23:21:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:21:57] [INFO ] Invariant cache hit.
[2023-03-21 23:21:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/63 places, 3/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 5/63 places, 3/45 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00 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 (EQ s2 0) (EQ s3 1))], 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 0 reset in 276 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-00 finished in 544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p1))&&p0)))'
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 58 transition count 32
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 19 rules applied. Total rules applied 34 place count 43 transition count 28
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 40 place count 39 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 37 transition count 26
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 42 place count 37 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 57 place count 28 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 57 place count 28 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 59 place count 27 transition count 19
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 7 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 20 transition count 14
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 72 place count 19 transition count 14
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 5 with 2 rules applied. Total rules applied 74 place count 18 transition count 13
Applied a total of 74 rules in 11 ms. Remains 18 /63 variables (removed 45) and now considering 13/45 (removed 32) transitions.
// Phase 1: matrix 13 rows 18 cols
[2023-03-21 23:21:58] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-21 23:21:58] [INFO ] Implicit Places using invariants in 28 ms returned [2, 8, 12, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/63 places, 13/45 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 12
Applied a total of 2 rules in 2 ms. Remains 13 /14 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 13 cols
[2023-03-21 23:21:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 23:21:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 23:21:58] [INFO ] Invariant cache hit.
[2023-03-21 23:21:58] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/63 places, 12/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 97 ms. Remains : 13/63 places, 12/45 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s9 0) (EQ s2 1)) (OR (EQ s4 0) (EQ s10 1))), p1:(OR (EQ s5 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 90 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-01 finished in 507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 58 transition count 29
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 41 transition count 27
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 39 transition count 25
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 45 place count 36 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 46 place count 35 transition count 24
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 46 place count 35 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 66 place count 23 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 66 place count 23 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 70 place count 21 transition count 14
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 8 places and 0 transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 83 place count 13 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 84 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 84 place count 12 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 89 place count 9 transition count 7
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 90 place count 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 93 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 95 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 96 place count 5 transition count 4
Applied a total of 96 rules in 13 ms. Remains 5 /63 variables (removed 58) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-21 23:21:58] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 23:21:58] [INFO ] Implicit Places using invariants in 18 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/63 places, 4/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 32 ms. Remains : 4/63 places, 4/45 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 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:(OR (EQ s2 0) (EQ s1 1))], 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 14376 reset in 82 ms.
Product exploration explored 100000 steps with 14268 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-21 23:21:59] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 23:21:59] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-21 23:21:59] [INFO ] Invariant cache hit.
[2023-03-21 23:21:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-21 23:21:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:21:59] [INFO ] Invariant cache hit.
[2023-03-21 23:21:59] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14232 reset in 58 ms.
Product exploration explored 100000 steps with 14294 reset in 46 ms.
Built C files in :
/tmp/ltsmin9489951621078316822
[2023-03-21 23:22:00] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-21 23:22:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:22:00] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-21 23:22:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:22:00] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-21 23:22:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:22:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9489951621078316822
Running compilation step : cd /tmp/ltsmin9489951621078316822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 141 ms.
Running link step : cd /tmp/ltsmin9489951621078316822;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin9489951621078316822;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5886955670225034036.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-02 finished in 1894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 59 transition count 45
Applied a total of 4 rules in 3 ms. Remains 59 /63 variables (removed 4) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 59 cols
[2023-03-21 23:22:00] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-21 23:22:00] [INFO ] Implicit Places using invariants in 49 ms returned [12, 14, 17, 29, 31, 32, 34]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 50 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/63 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 52/63 places, 45/45 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s27 0) (EQ s28 1)), p0:(OR (EQ s36 0) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-03 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p0)))))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 58 transition count 26
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 37 transition count 24
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 47 place count 35 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 34 transition count 23
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 48 place count 34 transition count 16
Deduced a syphon composed of 7 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 17 rules applied. Total rules applied 65 place count 24 transition count 16
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 65 place count 24 transition count 15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 23 transition count 15
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 82 place count 14 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 83 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 83 place count 13 transition count 8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 85 place count 12 transition count 8
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 93 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 96 place count 5 transition count 4
Applied a total of 96 rules in 11 ms. Remains 5 /63 variables (removed 58) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-21 23:22:01] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 23:22:01] [INFO ] Implicit Places using invariants in 17 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/63 places, 4/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 4/63 places, 4/45 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05 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 (EQ s2 0) (EQ s0 1))], 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 0 reset in 47 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-05 finished in 115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 58 transition count 45
Applied a total of 5 rules in 7 ms. Remains 58 /63 variables (removed 5) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2023-03-21 23:22:01] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-21 23:22:01] [INFO ] Implicit Places using invariants in 56 ms returned [12, 14, 17, 29, 31, 32, 33, 34, 35]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/63 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 49/63 places, 45/45 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06 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:(OR (EQ s15 0) (EQ s38 1))], 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 1 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-06 finished in 158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(!p1 U (p2||G(!p1))))))'
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 58 transition count 45
Applied a total of 5 rules in 6 ms. Remains 58 /63 variables (removed 5) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2023-03-21 23:22:01] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-21 23:22:01] [INFO ] Implicit Places using invariants in 42 ms returned [13, 14, 18, 31, 32, 33, 34, 35]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 43 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/63 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 50/63 places, 45/45 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (AND (NOT p2) p1 (NOT p0)), (NOT p0), (AND (NOT p2) p1 (NOT p0)), (AND p1 (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (NOT (AND (OR (EQ s34 0) (EQ s5 1)) (OR (EQ s29 0) (EQ s22 1)))) (NOT (OR (EQ s26 0) (EQ s14 1)))), p1:(OR (EQ s26 0) (EQ s14 1)), p0:(AND (EQ s5 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-07 finished in 284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 58 transition count 26
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 25 rules applied. Total rules applied 46 place count 37 transition count 22
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 50 place count 33 transition count 22
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 50 place count 33 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 68 place count 22 transition count 15
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 22 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 21 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 70 place count 21 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 19 transition count 12
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 8 places and 0 transitions.
Iterating global reduction 5 with 13 rules applied. Total rules applied 87 place count 11 transition count 7
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 88 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 90 place count 9 transition count 6
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 96 place count 5 transition count 4
Applied a total of 96 rules in 13 ms. Remains 5 /63 variables (removed 58) and now considering 4/45 (removed 41) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-21 23:22:01] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 23:22:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 23:22:01] [INFO ] Invariant cache hit.
[2023-03-21 23:22:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-21 23:22:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:22:01] [INFO ] Invariant cache hit.
[2023-03-21 23:22:01] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/63 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 5/63 places, 4/45 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11 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:(OR (EQ s4 0) (EQ s3 1))], 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 8631 reset in 50 ms.
Product exploration explored 100000 steps with 8612 reset in 59 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-21 23:22:02] [INFO ] Invariant cache hit.
[2023-03-21 23:22:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 23:22:02] [INFO ] Invariant cache hit.
[2023-03-21 23:22:02] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-21 23:22:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 23:22:02] [INFO ] Invariant cache hit.
[2023-03-21 23:22:02] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 5/5 places, 4/4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 152 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8585 reset in 53 ms.
Product exploration explored 100000 steps with 8503 reset in 52 ms.
Built C files in :
/tmp/ltsmin4000844670262585592
[2023-03-21 23:22:03] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2023-03-21 23:22:03] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:22:03] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2023-03-21 23:22:03] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:22:03] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2023-03-21 23:22:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-21 23:22:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4000844670262585592
Running compilation step : cd /tmp/ltsmin4000844670262585592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 76 ms.
Running link step : cd /tmp/ltsmin4000844670262585592;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4000844670262585592;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4094710521099288214.hoa' '--buchi-type=spotba'
LTSmin run took 40 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-11 finished in 1693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&X(X(p2))))))'
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Ensure Unique test removed 3 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 58 transition count 45
Applied a total of 5 rules in 2 ms. Remains 58 /63 variables (removed 5) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 58 cols
[2023-03-21 23:22:03] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-21 23:22:03] [INFO ] Implicit Places using invariants in 47 ms returned [12, 14, 17, 29, 31, 32, 33, 34, 35]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 49 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/63 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 49/63 places, 45/45 transitions.
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(EQ s22 1), p1:(EQ s12 1), p2:(OR (EQ s10 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 4000 reset in 65 ms.
Product exploration explored 100000 steps with 4000 reset in 70 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 325 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 39 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 381 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 45 rows 49 cols
[2023-03-21 23:22:05] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-21 23:22:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 23:22:05] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:22:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 23:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:22:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 23:22:05] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:22:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-21 23:22:05] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 23:22:05] [INFO ] Added : 37 causal constraints over 8 iterations in 53 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-21 23:22:05] [INFO ] Invariant cache hit.
[2023-03-21 23:22:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 23:22:05] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:22:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-21 23:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:22:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 23:22:05] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-21 23:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:22:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-21 23:22:05] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 23:22:05] [INFO ] Added : 41 causal constraints over 9 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-21 23:22:05] [INFO ] Invariant cache hit.
[2023-03-21 23:22:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 23:22:05] [INFO ] Invariant cache hit.
[2023-03-21 23:22:05] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-21 23:22:05] [INFO ] Invariant cache hit.
[2023-03-21 23:22:05] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 49/49 places, 45/45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 39 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 319 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-21 23:22:06] [INFO ] Invariant cache hit.
[2023-03-21 23:22:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 23:22:06] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 23:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:22:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-21 23:22:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:22:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 23:22:06] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 23:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:22:06] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-21 23:22:06] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 23:22:06] [INFO ] Added : 37 causal constraints over 8 iterations in 41 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-21 23:22:06] [INFO ] Invariant cache hit.
[2023-03-21 23:22:06] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 23:22:06] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 23:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 23:22:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-21 23:22:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 23:22:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-21 23:22:06] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-21 23:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 23:22:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-21 23:22:06] [INFO ] Computed and/alt/rep : 44/45/44 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 23:22:06] [INFO ] Added : 41 causal constraints over 9 iterations in 41 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4000 reset in 74 ms.
Product exploration explored 100000 steps with 4000 reset in 67 ms.
Built C files in :
/tmp/ltsmin1954762941319984659
[2023-03-21 23:22:07] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1954762941319984659
Running compilation step : cd /tmp/ltsmin1954762941319984659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 115 ms.
Running link step : cd /tmp/ltsmin1954762941319984659;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1954762941319984659;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16282603442904284555.hoa' '--buchi-type=spotba'
LTSmin run took 115 ms.
FORMULA IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C01M01P01D01-LTLCardinality-13 finished in 4219 ms.
All properties solved by simple procedures.
Total runtime 11439 ms.

BK_STOP 1679440928613

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="IOTPpurchase-PT-C01M01P01D01"
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-5348"
echo " Executing tool itstools"
echo " Input is IOTPpurchase-PT-C01M01P01D01, 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 r229-tall-167856412800107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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