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

About the Execution of ITS-Tools for Anderson-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
461.880 29420.00 29241.00 5936.10 FFTTFFFTFFFFTFFF 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.r517-tall-167987243300003.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 Anderson-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 103K Mar 31 16:48 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 Anderson-PT-04-LTLCardinality-00
FORMULA_NAME Anderson-PT-04-LTLCardinality-01
FORMULA_NAME Anderson-PT-04-LTLCardinality-02
FORMULA_NAME Anderson-PT-04-LTLCardinality-03
FORMULA_NAME Anderson-PT-04-LTLCardinality-04
FORMULA_NAME Anderson-PT-04-LTLCardinality-05
FORMULA_NAME Anderson-PT-04-LTLCardinality-06
FORMULA_NAME Anderson-PT-04-LTLCardinality-07
FORMULA_NAME Anderson-PT-04-LTLCardinality-08
FORMULA_NAME Anderson-PT-04-LTLCardinality-09
FORMULA_NAME Anderson-PT-04-LTLCardinality-10
FORMULA_NAME Anderson-PT-04-LTLCardinality-11
FORMULA_NAME Anderson-PT-04-LTLCardinality-12
FORMULA_NAME Anderson-PT-04-LTLCardinality-13
FORMULA_NAME Anderson-PT-04-LTLCardinality-14
FORMULA_NAME Anderson-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680840903929

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=Anderson-PT-04
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 04:15:05] [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-04-07 04:15:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:15:06] [INFO ] Load time of PNML (sax parser for PT used): 1297 ms
[2023-04-07 04:15:06] [INFO ] Transformed 105 places.
[2023-04-07 04:15:06] [INFO ] Transformed 200 transitions.
[2023-04-07 04:15:06] [INFO ] Found NUPN structural information;
[2023-04-07 04:15:06] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 1362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 92 transition count 127
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 92 transition count 127
Applied a total of 26 rules in 56 ms. Remains 92 /105 variables (removed 13) and now considering 127/200 (removed 73) transitions.
// Phase 1: matrix 127 rows 92 cols
[2023-04-07 04:15:06] [INFO ] Computed 11 invariants in 13 ms
[2023-04-07 04:15:07] [INFO ] Implicit Places using invariants in 212 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 240 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/105 places, 127/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 300 ms. Remains : 91/105 places, 127/200 transitions.
Support contains 25 out of 91 places after structural reductions.
[2023-04-07 04:15:07] [INFO ] Flatten gal took : 32 ms
[2023-04-07 04:15:07] [INFO ] Flatten gal took : 15 ms
[2023-04-07 04:15:07] [INFO ] Input system was already deterministic with 127 transitions.
Finished random walk after 8168 steps, including 2 resets, run visited all 18 properties in 214 ms. (steps per millisecond=38 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 80 transition count 104
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 80 transition count 104
Applied a total of 22 rules in 6 ms. Remains 80 /91 variables (removed 11) and now considering 104/127 (removed 23) transitions.
// Phase 1: matrix 104 rows 80 cols
[2023-04-07 04:15:07] [INFO ] Computed 10 invariants in 3 ms
[2023-04-07 04:15:07] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-04-07 04:15:07] [INFO ] Invariant cache hit.
[2023-04-07 04:15:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:08] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-04-07 04:15:08] [INFO ] Invariant cache hit.
[2023-04-07 04:15:08] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/91 places, 104/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 80/91 places, 104/127 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s72 0) (EQ s67 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 170 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 : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-04-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-04-LTLCardinality-02 finished in 977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 91 transition count 112
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 76 transition count 112
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 76 transition count 101
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 65 transition count 101
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 56 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 56 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 55 transition count 85
Applied a total of 72 rules in 25 ms. Remains 55 /91 variables (removed 36) and now considering 85/127 (removed 42) transitions.
// Phase 1: matrix 85 rows 55 cols
[2023-04-07 04:15:08] [INFO ] Computed 10 invariants in 3 ms
[2023-04-07 04:15:08] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-04-07 04:15:08] [INFO ] Invariant cache hit.
[2023-04-07 04:15:08] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:09] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-04-07 04:15:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 04:15:09] [INFO ] Invariant cache hit.
[2023-04-07 04:15:09] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 55/91 places, 85/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 55/91 places, 85/127 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-03 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 s32 0) (EQ s16 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 20 reset in 110 ms.
Product exploration explored 100000 steps with 16 reset in 207 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 73 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 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2414 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=241 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 85/85 transitions.
Applied a total of 0 rules in 9 ms. Remains 55 /55 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2023-04-07 04:15:09] [INFO ] Invariant cache hit.
[2023-04-07 04:15:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-07 04:15:09] [INFO ] Invariant cache hit.
[2023-04-07 04:15:09] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:10] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-04-07 04:15:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 04:15:10] [INFO ] Invariant cache hit.
[2023-04-07 04:15:10] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 55/55 places, 85/85 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 310 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 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6466 steps, including 1 resets, run visited all 1 properties in 22 ms. (steps per millisecond=293 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22 reset in 86 ms.
Product exploration explored 100000 steps with 22 reset in 90 ms.
Built C files in :
/tmp/ltsmin15628487101955581855
[2023-04-07 04:15:11] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2023-04-07 04:15:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:11] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2023-04-07 04:15:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:11] [INFO ] Computing Do-Not-Accords matrix : 85 transitions.
[2023-04-07 04:15:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:11] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15628487101955581855
Running compilation step : cd /tmp/ltsmin15628487101955581855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin15628487101955581855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15628487101955581855;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased968849017623841293.hoa' '--buchi-type=spotba'
LTSmin run took 528 ms.
FORMULA Anderson-PT-04-LTLCardinality-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-03 finished in 3236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 91 transition count 112
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 76 transition count 112
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 30 place count 76 transition count 101
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 52 place count 65 transition count 101
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 55 transition count 79
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 55 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 54 transition count 78
Applied a total of 74 rules in 18 ms. Remains 54 /91 variables (removed 37) and now considering 78/127 (removed 49) transitions.
// Phase 1: matrix 78 rows 54 cols
[2023-04-07 04:15:12] [INFO ] Computed 10 invariants in 4 ms
[2023-04-07 04:15:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-04-07 04:15:12] [INFO ] Invariant cache hit.
[2023-04-07 04:15:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:12] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-04-07 04:15:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 04:15:12] [INFO ] Invariant cache hit.
[2023-04-07 04:15:12] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/91 places, 78/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 54/91 places, 78/127 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s53 0), p1:(EQ s23 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 0 reset in 129 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-04 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
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 16 rules applied. Total rules applied 16 place count 91 transition count 111
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 75 transition count 111
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 75 transition count 101
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 52 place count 65 transition count 101
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 56 transition count 80
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 56 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 74 place count 54 transition count 78
Applied a total of 74 rules in 16 ms. Remains 54 /91 variables (removed 37) and now considering 78/127 (removed 49) transitions.
// Phase 1: matrix 78 rows 54 cols
[2023-04-07 04:15:12] [INFO ] Computed 10 invariants in 2 ms
[2023-04-07 04:15:12] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-04-07 04:15:12] [INFO ] Invariant cache hit.
[2023-04-07 04:15:12] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:12] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-04-07 04:15:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 04:15:12] [INFO ] Invariant cache hit.
[2023-04-07 04:15:12] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/91 places, 78/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 54/91 places, 78/127 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-04-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 s27 0) (EQ s24 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 96 ms.
Stack based approach found an accepted trace after 254 steps with 0 reset with depth 255 and stack size 168 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-05 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)||G((p2||(p3&&X(G((p3||G(p4)))))))))'
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 113
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 113
Applied a total of 16 rules in 5 ms. Remains 83 /91 variables (removed 8) and now considering 113/127 (removed 14) transitions.
// Phase 1: matrix 113 rows 83 cols
[2023-04-07 04:15:12] [INFO ] Computed 10 invariants in 3 ms
[2023-04-07 04:15:12] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-04-07 04:15:12] [INFO ] Invariant cache hit.
[2023-04-07 04:15:13] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:13] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-04-07 04:15:13] [INFO ] Invariant cache hit.
[2023-04-07 04:15:13] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 83/91 places, 113/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 ms. Remains : 83/91 places, 113/127 transitions.
Stuttering acceptance computed with spot in 497 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1) p4), acceptance={} source=2 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1) (NOT p4))), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p3 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p3) p4), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p4))), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) p2 p4) (AND (NOT p0) p3 p4)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4))), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=1, aps=[p0:(EQ s14 1), p1:(OR (EQ s26 0) (EQ s59 1)), p2:(EQ s6 0), p3:(NEQ s6 1), p4:(AND (NEQ s53 0) (NEQ s17 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 145 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) p1 p2 p3 (NOT p4)), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1) p4))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1) (NOT p4))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p3 (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2 p4) (AND (NOT p0) p3 p4))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p4))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p4)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p4))))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 21 ms. Reduced automaton from 8 states, 19 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-04-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-04-LTLCardinality-07 finished in 1095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U !p1))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 91 transition count 112
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 76 transition count 112
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 76 transition count 103
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 48 place count 67 transition count 103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 57 transition count 81
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 57 transition count 81
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 2 with 2 rules applied. Total rules applied 70 place count 56 transition count 80
Applied a total of 70 rules in 8 ms. Remains 56 /91 variables (removed 35) and now considering 80/127 (removed 47) transitions.
// Phase 1: matrix 80 rows 56 cols
[2023-04-07 04:15:14] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 04:15:14] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-04-07 04:15:14] [INFO ] Invariant cache hit.
[2023-04-07 04:15:14] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:14] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-04-07 04:15:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 04:15:14] [INFO ] Invariant cache hit.
[2023-04-07 04:15:14] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/91 places, 80/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 56/91 places, 80/127 transitions.
Stuttering acceptance computed with spot in 119 ms :[p1, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s32 0) (EQ s31 1)), p0:(OR (EQ s55 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 435 reset in 78 ms.
Product exploration explored 100000 steps with 414 reset in 121 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 (NOT (AND p1 (NOT p0)))), (X p0), (X p1), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[p1, (NOT p0), (NOT p0)]
Finished random walk after 234 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 150 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[p1, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[p1, (NOT p0), (NOT p0)]
[2023-04-07 04:15:15] [INFO ] Invariant cache hit.
[2023-04-07 04:15:15] [INFO ] [Real]Absence check using 5 positive place invariants in 38 ms returned sat
[2023-04-07 04:15:15] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 11 ms returned sat
[2023-04-07 04:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:15:15] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-04-07 04:15:15] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:15:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-04-07 04:15:15] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 04:15:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:15:15] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-04-07 04:15:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:15] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-04-07 04:15:15] [INFO ] Computed and/alt/rep : 76/380/76 causal constraints (skipped 0 transitions) in 5 ms.
[2023-04-07 04:15:15] [INFO ] Added : 62 causal constraints over 13 iterations in 155 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 80/80 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-04-07 04:15:15] [INFO ] Invariant cache hit.
[2023-04-07 04:15:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 04:15:15] [INFO ] Invariant cache hit.
[2023-04-07 04:15:15] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:15] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-04-07 04:15:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 04:15:15] [INFO ] Invariant cache hit.
[2023-04-07 04:15:15] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 56/56 places, 80/80 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 p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 6883 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 460 ms :[p1, (NOT p0), (NOT p0)]
Finished random walk after 186 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=93 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), true, (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 8 factoid took 167 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[p1, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[p1, (NOT p0), (NOT p0)]
[2023-04-07 04:15:23] [INFO ] Invariant cache hit.
[2023-04-07 04:15:23] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-04-07 04:15:23] [INFO ] [Real]Absence check using 5 positive and 5 generalized place invariants in 11 ms returned sat
[2023-04-07 04:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:15:23] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-04-07 04:15:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:15:23] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-04-07 04:15:23] [INFO ] [Nat]Absence check using 5 positive and 5 generalized place invariants in 6 ms returned sat
[2023-04-07 04:15:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:15:23] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-04-07 04:15:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:23] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-04-07 04:15:23] [INFO ] Computed and/alt/rep : 76/380/76 causal constraints (skipped 0 transitions) in 6 ms.
[2023-04-07 04:15:23] [INFO ] Added : 62 causal constraints over 13 iterations in 127 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 116 ms :[p1, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 446 reset in 82 ms.
Product exploration explored 100000 steps with 404 reset in 81 ms.
Built C files in :
/tmp/ltsmin17977477074772050355
[2023-04-07 04:15:24] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2023-04-07 04:15:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:24] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2023-04-07 04:15:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:24] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2023-04-07 04:15:24] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:24] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17977477074772050355
Running compilation step : cd /tmp/ltsmin17977477074772050355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 183 ms.
Running link step : cd /tmp/ltsmin17977477074772050355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17977477074772050355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17985242257318928096.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA Anderson-PT-04-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-08 finished in 10514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 106
Applied a total of 18 rules in 3 ms. Remains 82 /91 variables (removed 9) and now considering 106/127 (removed 21) transitions.
// Phase 1: matrix 106 rows 82 cols
[2023-04-07 04:15:24] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 04:15:24] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-04-07 04:15:24] [INFO ] Invariant cache hit.
[2023-04-07 04:15:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:24] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-04-07 04:15:24] [INFO ] Invariant cache hit.
[2023-04-07 04:15:24] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/91 places, 106/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 82/91 places, 106/127 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s29 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLCardinality-10 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&G(!p1)))))'
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 91 transition count 112
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 76 transition count 112
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 30 place count 76 transition count 100
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 54 place count 64 transition count 100
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 53 transition count 77
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 53 transition count 77
Applied a total of 76 rules in 16 ms. Remains 53 /91 variables (removed 38) and now considering 77/127 (removed 50) transitions.
// Phase 1: matrix 77 rows 53 cols
[2023-04-07 04:15:24] [INFO ] Computed 10 invariants in 3 ms
[2023-04-07 04:15:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-04-07 04:15:24] [INFO ] Invariant cache hit.
[2023-04-07 04:15:24] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:25] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-04-07 04:15:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 04:15:25] [INFO ] Invariant cache hit.
[2023-04-07 04:15:25] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/91 places, 77/127 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 53/91 places, 77/127 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s27 0) (EQ s4 1)), p0:(NEQ s52 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 635 reset in 119 ms.
Product exploration explored 100000 steps with 584 reset in 126 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 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Finished random walk after 34 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 185 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 3361 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 77/77 transitions.
Applied a total of 0 rules in 8 ms. Remains 53 /53 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2023-04-07 04:15:29] [INFO ] Invariant cache hit.
[2023-04-07 04:15:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-04-07 04:15:29] [INFO ] Invariant cache hit.
[2023-04-07 04:15:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:29] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-04-07 04:15:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 04:15:29] [INFO ] Invariant cache hit.
[2023-04-07 04:15:29] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 53/53 places, 77/77 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 p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 613 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Finished random walk after 146 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=146 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 184 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 558 reset in 88 ms.
Product exploration explored 100000 steps with 587 reset in 95 ms.
Built C files in :
/tmp/ltsmin11826065066363048614
[2023-04-07 04:15:31] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2023-04-07 04:15:31] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:31] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2023-04-07 04:15:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:31] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2023-04-07 04:15:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:15:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11826065066363048614
Running compilation step : cd /tmp/ltsmin11826065066363048614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 187 ms.
Running link step : cd /tmp/ltsmin11826065066363048614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11826065066363048614;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18117069840656047684.hoa' '--buchi-type=spotba'
LTSmin run took 96 ms.
FORMULA Anderson-PT-04-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-04-LTLCardinality-12 finished in 6587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G(p1))))))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 106
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 106
Applied a total of 18 rules in 3 ms. Remains 82 /91 variables (removed 9) and now considering 106/127 (removed 21) transitions.
// Phase 1: matrix 106 rows 82 cols
[2023-04-07 04:15:31] [INFO ] Computed 10 invariants in 3 ms
[2023-04-07 04:15:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-04-07 04:15:31] [INFO ] Invariant cache hit.
[2023-04-07 04:15:31] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:31] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-04-07 04:15:31] [INFO ] Invariant cache hit.
[2023-04-07 04:15:31] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/91 places, 106/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 82/91 places, 106/127 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s20 1)), p1:(OR (EQ s18 0) (EQ s35 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 73 ms.
Stack based approach found an accepted trace after 346 steps with 0 reset with depth 347 and stack size 196 in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLCardinality-13 finished in 468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 127/127 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 82 transition count 112
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 82 transition count 112
Applied a total of 18 rules in 6 ms. Remains 82 /91 variables (removed 9) and now considering 112/127 (removed 15) transitions.
// Phase 1: matrix 112 rows 82 cols
[2023-04-07 04:15:31] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 04:15:31] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-04-07 04:15:31] [INFO ] Invariant cache hit.
[2023-04-07 04:15:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 04:15:32] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-04-07 04:15:32] [INFO ] Invariant cache hit.
[2023-04-07 04:15:32] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/91 places, 112/127 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 82/91 places, 112/127 transitions.
Stuttering acceptance computed with spot in 191 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (NEQ s14 0) (NEQ s23 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLCardinality-14 finished in 444 ms.
All properties solved by simple procedures.
Total runtime 26989 ms.

BK_STOP 1680840933349

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

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

Sequence of Actions to be Executed by the VM

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

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

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