fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r293-tall-167873945900795
Last Updated
May 14, 2023

About the Execution of ITS-Tools for ProductionCell-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
481.319 16792.00 23549.00 1398.40 TFFFTFFFFFFFTTTF normal

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.r293-tall-167873945900795.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 ProductionCell-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945900795
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.4K Feb 25 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 14:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:23 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 ProductionCell-PT-none-LTLCardinality-00
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-01
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-02
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-03
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-04
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-05
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-06
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-07
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-08
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-09
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-10
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-11
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-12
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-13
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-14
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678977721372

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=ProductionCell-PT-none
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-16 14:42:02] [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-16 14:42:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 14:42:02] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-16 14:42:02] [INFO ] Transformed 176 places.
[2023-03-16 14:42:02] [INFO ] Transformed 134 transitions.
[2023-03-16 14:42:02] [INFO ] Found NUPN structural information;
[2023-03-16 14:42:02] [INFO ] Parsed PT model containing 176 places and 134 transitions and 513 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ProductionCell-PT-none-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 131
Applied a total of 6 rules in 33 ms. Remains 173 /176 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 173 cols
[2023-03-16 14:42:03] [INFO ] Computed 50 place invariants in 16 ms
[2023-03-16 14:42:03] [INFO ] Implicit Places using invariants in 238 ms returned [36, 42, 58, 127, 133, 134, 138]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 263 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/176 places, 131/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 165 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 165 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 164 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 164 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 163 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 163 transition count 127
Applied a total of 6 rules in 22 ms. Remains 163 /166 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 163 cols
[2023-03-16 14:42:03] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-16 14:42:03] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-16 14:42:03] [INFO ] Invariant cache hit.
[2023-03-16 14:42:03] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 163/176 places, 127/134 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 591 ms. Remains : 163/176 places, 127/134 transitions.
Support contains 32 out of 163 places after structural reductions.
[2023-03-16 14:42:03] [INFO ] Flatten gal took : 34 ms
[2023-03-16 14:42:03] [INFO ] Flatten gal took : 14 ms
[2023-03-16 14:42:03] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 31 out of 163 places (down from 32) after GAL structural reductions.
Finished random walk after 1678 steps, including 0 resets, run visited all 19 properties in 191 ms. (steps per millisecond=8 )
FORMULA ProductionCell-PT-none-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ProductionCell-PT-none-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 21 stabilizing places and 25 stable transitions
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(X(G((F(p0)||X(p1)))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-16 14:42:04] [INFO ] Invariant cache hit.
[2023-03-16 14:42:04] [INFO ] Implicit Places using invariants in 87 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/163 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 162/163 places, 127/127 transitions.
Stuttering acceptance computed with spot in 339 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-00 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=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s128 1)), p1:(AND (EQ s128 0) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 162 reset in 272 ms.
Product exploration explored 100000 steps with 167 reset in 229 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 162 cols
[2023-03-16 14:42:05] [INFO ] Computed 42 place invariants in 6 ms
[2023-03-16 14:42:05] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 14:42:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-16 14:42:05] [INFO ] [Nat]Absence check using 33 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-16 14:42:05] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ProductionCell-PT-none-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ProductionCell-PT-none-LTLCardinality-00 finished in 1608 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(p0)&&G(p1))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 163 cols
[2023-03-16 14:42:05] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-16 14:42:05] [INFO ] Implicit Places using invariants in 88 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/163 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 162/163 places, 127/127 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(NEQ s49 1), p0:(OR (EQ s26 0) (EQ s104 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 343 steps with 0 reset in 2 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-01 finished in 288 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(G((p0 U p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 127/127 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 0 with 4 rules applied. Total rules applied 4 place count 163 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 159 transition count 123
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 8 place count 159 transition count 97
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 61 place count 132 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 61 place count 132 transition count 96
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 131 transition count 96
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 121 transition count 86
Applied a total of 83 rules in 25 ms. Remains 121 /163 variables (removed 42) and now considering 86/127 (removed 41) transitions.
// Phase 1: matrix 86 rows 121 cols
[2023-03-16 14:42:06] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-16 14:42:06] [INFO ] Implicit Places using invariants in 72 ms returned [20, 21, 68, 69, 70, 71]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/163 places, 86/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 115/163 places, 86/127 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s64 0) (EQ s79 1)), p0:(OR (EQ s91 0) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 245 ms.
Product exploration explored 100000 steps with 0 reset in 310 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 p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 230 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 3) seen :1
Finished Best-First random walk after 25 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 361 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), (NOT p1)]
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 86/86 transitions.
Applied a total of 0 rules in 9 ms. Remains 115 /115 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 115 cols
[2023-03-16 14:42:07] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-16 14:42:08] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-16 14:42:08] [INFO ] Invariant cache hit.
[2023-03-16 14:42:08] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-16 14:42:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 14:42:08] [INFO ] Invariant cache hit.
[2023-03-16 14:42:08] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 115/115 places, 86/86 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 3) seen :1
Finished Best-First random walk after 22 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 345 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 683 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 165 ms.
Product exploration explored 100000 steps with 5 reset in 355 ms.
Built C files in :
/tmp/ltsmin2902075180104057216
[2023-03-16 14:42:10] [INFO ] Computing symmetric may disable matrix : 86 transitions.
[2023-03-16 14:42:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:42:10] [INFO ] Computing symmetric may enable matrix : 86 transitions.
[2023-03-16 14:42:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:42:10] [INFO ] Computing Do-Not-Accords matrix : 86 transitions.
[2023-03-16 14:42:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-16 14:42:10] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2902075180104057216
Running compilation step : cd /tmp/ltsmin2902075180104057216;'/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 305 ms.
Running link step : cd /tmp/ltsmin2902075180104057216;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin2902075180104057216;'/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/stateBased11219308514321959247.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ProductionCell-PT-none-LTLCardinality-02 finished in 4742 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(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 127/127 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 0 with 4 rules applied. Total rules applied 4 place count 163 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 159 transition count 123
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 8 place count 159 transition count 97
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 61 place count 132 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 61 place count 132 transition count 96
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 131 transition count 96
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 121 transition count 86
Applied a total of 83 rules in 19 ms. Remains 121 /163 variables (removed 42) and now considering 86/127 (removed 41) transitions.
// Phase 1: matrix 86 rows 121 cols
[2023-03-16 14:42:10] [INFO ] Computed 42 place invariants in 1 ms
[2023-03-16 14:42:11] [INFO ] Implicit Places using invariants in 74 ms returned [20, 21, 67, 68, 69, 70]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 76 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/163 places, 86/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 115/163 places, 86/127 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s68 0) (NEQ s38 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 162 ms.
Stack based approach found an accepted trace after 401 steps with 0 reset with depth 402 and stack size 402 in 1 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-03 finished in 313 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(p1)||G(p2))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 127/127 transitions.
Reduce places removed 1 places and 1 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 0 with 4 rules applied. Total rules applied 4 place count 162 transition count 122
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 158 transition count 122
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 8 place count 158 transition count 96
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 61 place count 131 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 79 place count 122 transition count 87
Applied a total of 79 rules in 19 ms. Remains 122 /163 variables (removed 41) and now considering 87/127 (removed 40) transitions.
// Phase 1: matrix 87 rows 122 cols
[2023-03-16 14:42:11] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-16 14:42:11] [INFO ] Implicit Places using invariants in 81 ms returned [19, 20, 68, 69, 71]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 82 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/163 places, 87/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 117/163 places, 87/127 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s41 0) (EQ s56 1)), p1:(AND (EQ s66 0) (EQ s57 1)), p2:(AND (NEQ s56 0) (NEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 326 reset in 189 ms.
Stack based approach found an accepted trace after 483 steps with 2 reset with depth 60 and stack size 60 in 2 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-05 finished in 508 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((p0&&F(G(p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 163 cols
[2023-03-16 14:42:11] [INFO ] Computed 43 place invariants in 2 ms
[2023-03-16 14:42:11] [INFO ] Implicit Places using invariants in 82 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 83 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/163 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 162/163 places, 127/127 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s92 0) (EQ s145 1)), p1:(OR (EQ s119 0) (EQ s157 1))], 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]]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 1 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-06 finished in 392 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 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 162 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 159 transition count 123
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 6 place count 159 transition count 96
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 61 place count 131 transition count 96
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 61 place count 131 transition count 95
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 130 transition count 95
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 120 transition count 85
Applied a total of 83 rules in 19 ms. Remains 120 /163 variables (removed 43) and now considering 85/127 (removed 42) transitions.
// Phase 1: matrix 85 rows 120 cols
[2023-03-16 14:42:12] [INFO ] Computed 42 place invariants in 2 ms
[2023-03-16 14:42:12] [INFO ] Implicit Places using invariants in 76 ms returned [19, 20, 67, 68, 69, 70]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 79 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/163 places, 85/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 114/163 places, 85/127 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s62 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 1905 reset in 146 ms.
Stack based approach found an accepted trace after 106 steps with 3 reset with depth 35 and stack size 35 in 1 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-10 finished in 334 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(F((p0&&X(F(p1))))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 127/127 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 163 cols
[2023-03-16 14:42:12] [INFO ] Computed 43 place invariants in 1 ms
[2023-03-16 14:42:12] [INFO ] Implicit Places using invariants in 76 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/163 places, 127/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 162/163 places, 127/127 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s130 0) (EQ s55 1)), p0:(OR (EQ s110 0) (EQ s33 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][false, false, false]]
Product exploration explored 100000 steps with 485 reset in 152 ms.
Stack based approach found an accepted trace after 144 steps with 0 reset with depth 145 and stack size 145 in 0 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-11 finished in 358 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(F(p0))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 127/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 127/127 (removed 0) transitions.
[2023-03-16 14:42:12] [INFO ] Invariant cache hit.
[2023-03-16 14:42:12] [INFO ] Implicit Places using invariants in 76 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 78 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/163 places, 127/127 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 162/163 places, 127/127 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s161 0) (EQ s77 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 149 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 46 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ProductionCell-PT-none-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ProductionCell-PT-none-LTLCardinality-14 finished in 548 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(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 127/127 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 0 with 4 rules applied. Total rules applied 4 place count 163 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 159 transition count 123
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 8 place count 159 transition count 97
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 53 rules applied. Total rules applied 61 place count 132 transition count 97
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 61 place count 132 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 131 transition count 96
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 83 place count 121 transition count 86
Applied a total of 83 rules in 19 ms. Remains 121 /163 variables (removed 42) and now considering 86/127 (removed 41) transitions.
// Phase 1: matrix 86 rows 121 cols
[2023-03-16 14:42:13] [INFO ] Computed 42 place invariants in 3 ms
[2023-03-16 14:42:13] [INFO ] Implicit Places using invariants in 73 ms returned [20, 21, 67, 68, 69, 70]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/163 places, 86/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 100 ms. Remains : 115/163 places, 86/127 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-15 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 s21 0) (EQ s76 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 148 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 1 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-15 finished in 303 ms.
All properties solved by simple procedures.
Total runtime 10886 ms.

BK_STOP 1678977738164

--------------------
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="ProductionCell-PT-none"
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 ProductionCell-PT-none, 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 r293-tall-167873945900795"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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