fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r186-tajo-165281572100307
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for Railroad-PT-020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
270.035 11493.00 25355.00 45.80 FFFFFFFTFFFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572100307.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Railroad-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572100307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Apr 29 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 255K May 10 09:34 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 Railroad-PT-020-LTLCardinality-00
FORMULA_NAME Railroad-PT-020-LTLCardinality-01
FORMULA_NAME Railroad-PT-020-LTLCardinality-02
FORMULA_NAME Railroad-PT-020-LTLCardinality-03
FORMULA_NAME Railroad-PT-020-LTLCardinality-04
FORMULA_NAME Railroad-PT-020-LTLCardinality-05
FORMULA_NAME Railroad-PT-020-LTLCardinality-06
FORMULA_NAME Railroad-PT-020-LTLCardinality-07
FORMULA_NAME Railroad-PT-020-LTLCardinality-08
FORMULA_NAME Railroad-PT-020-LTLCardinality-09
FORMULA_NAME Railroad-PT-020-LTLCardinality-10
FORMULA_NAME Railroad-PT-020-LTLCardinality-11
FORMULA_NAME Railroad-PT-020-LTLCardinality-12
FORMULA_NAME Railroad-PT-020-LTLCardinality-13
FORMULA_NAME Railroad-PT-020-LTLCardinality-14
FORMULA_NAME Railroad-PT-020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653082499953

Running Version 202205111006
[2022-05-20 21:35:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 21:35:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:35:01] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2022-05-20 21:35:01] [INFO ] Transformed 218 places.
[2022-05-20 21:35:01] [INFO ] Transformed 506 transitions.
[2022-05-20 21:35:01] [INFO ] Found NUPN structural information;
[2022-05-20 21:35:01] [INFO ] Parsed PT model containing 218 places and 506 transitions in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 20 transitions.
FORMULA Railroad-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-020-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 486/486 transitions.
Ensure Unique test removed 21 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 136 transition count 486
Applied a total of 21 rules in 21 ms. Remains 136 /157 variables (removed 21) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 136 cols
[2022-05-20 21:35:01] [INFO ] Computed 50 place invariants in 19 ms
[2022-05-20 21:35:02] [INFO ] Implicit Places using invariants in 383 ms returned [0, 2, 6, 9, 11, 17, 39, 60, 62, 63, 66, 74, 75, 79, 80, 106, 112, 116, 121, 125, 129, 132, 134]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 411 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 113/157 places, 486/486 transitions.
Applied a total of 0 rules in 7 ms. Remains 113 /113 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 113/157 places, 486/486 transitions.
Support contains 16 out of 113 places after structural reductions.
[2022-05-20 21:35:02] [INFO ] Flatten gal took : 68 ms
[2022-05-20 21:35:02] [INFO ] Flatten gal took : 36 ms
[2022-05-20 21:35:02] [INFO ] Input system was already deterministic with 486 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 486 rows 113 cols
[2022-05-20 21:35:02] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:35:02] [INFO ] After 121ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:1
[2022-05-20 21:35:02] [INFO ] After 151ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2022-05-20 21:35:03] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :1 real:1
[2022-05-20 21:35:03] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-20 21:35:03] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2022-05-20 21:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-20 21:35:03] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2022-05-20 21:35:03] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 2 properties in 5 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(F(p0)))&&X(F((X(p1)&&X(p2))))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 486
Applied a total of 1 rules in 10 ms. Remains 112 /113 variables (removed 1) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2022-05-20 21:35:03] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-20 21:35:03] [INFO ] Implicit Places using invariants in 164 ms returned [9, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 174 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/113 places, 486/486 transitions.
Applied a total of 0 rules in 7 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/113 places, 486/486 transitions.
Stuttering acceptance computed with spot in 361 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s47 0), p1:(EQ s47 1), p2:(EQ s38 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1012 reset in 687 ms.
Stack based approach found an accepted trace after 2402 steps with 22 reset with depth 17 and stack size 17 in 12 ms.
FORMULA Railroad-PT-020-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-01 finished in 1314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((G((!G(F(p0))||p1)) U p0)))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 486/486 transitions.
Ensure Unique test removed 1 places
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 112 transition count 483
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 483
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 6 place count 109 transition count 466
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 92 transition count 466
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 46 place count 89 transition count 463
Applied a total of 46 rules in 160 ms. Remains 89 /113 variables (removed 24) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 89 cols
[2022-05-20 21:35:05] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-20 21:35:05] [INFO ] Implicit Places using invariants in 230 ms returned [9, 46]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 233 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/113 places, 463/486 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 85 transition count 462
Applied a total of 3 rules in 48 ms. Remains 85 /87 variables (removed 2) and now considering 462/463 (removed 1) transitions.
// Phase 1: matrix 462 rows 85 cols
[2022-05-20 21:35:05] [INFO ] Invariants computation overflowed in 3 ms
[2022-05-20 21:35:06] [INFO ] Implicit Places using invariants in 1310 ms returned []
// Phase 1: matrix 462 rows 85 cols
[2022-05-20 21:35:06] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-20 21:35:06] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/113 places, 462/486 transitions.
Finished structural reductions, in 2 iterations. Remains : 85/113 places, 462/486 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0), false, false, (NOT p0), false, false]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={2} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1, 2} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={2} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={2} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={1, 2} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s33 0), p1:(EQ s31 0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 123 reset in 485 ms.
Stack based approach found an accepted trace after 69161 steps with 99 reset with depth 840 and stack size 840 in 361 ms.
FORMULA Railroad-PT-020-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-05 finished in 3185 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G((!G(p1)&&p2))&&p1) U X(X(G(p3))))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 486
Applied a total of 1 rules in 9 ms. Remains 112 /113 variables (removed 1) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2022-05-20 21:35:08] [INFO ] Computed 26 place invariants in 7 ms
[2022-05-20 21:35:08] [INFO ] Implicit Places using invariants in 174 ms returned [65]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/113 places, 486/486 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 111/113 places, 486/486 transitions.
Stuttering acceptance computed with spot in 292 ms :[(NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p3))), p1, (OR (NOT p2) p1)]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND p0 p3), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2 p3), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p2 p3), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=p1, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=(AND p1 p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=3, aps=[p3:(OR (EQ s89 0) (EQ s33 1)), p1:(EQ s53 0), p0:(OR (EQ s0 0) (EQ s33 1)), p2:(OR (EQ s89 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 257 steps with 0 reset in 3 ms.
FORMULA Railroad-PT-020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLCardinality-08 finished in 547 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 486/486 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 112 transition count 484
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 484
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 4 place count 110 transition count 465
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 42 place count 91 transition count 465
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 44 place count 90 transition count 464
Applied a total of 44 rules in 46 ms. Remains 90 /113 variables (removed 23) and now considering 464/486 (removed 22) transitions.
// Phase 1: matrix 464 rows 90 cols
[2022-05-20 21:35:08] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-20 21:35:08] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 464 rows 90 cols
[2022-05-20 21:35:08] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-20 21:35:08] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [9, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 316 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/113 places, 464/486 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 463
Applied a total of 2 rules in 30 ms. Remains 87 /88 variables (removed 1) and now considering 463/464 (removed 1) transitions.
// Phase 1: matrix 463 rows 87 cols
[2022-05-20 21:35:08] [INFO ] Computed 24 place invariants in 5 ms
[2022-05-20 21:35:09] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 463 rows 87 cols
[2022-05-20 21:35:09] [INFO ] Computed 24 place invariants in 5 ms
[2022-05-20 21:35:09] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/113 places, 463/486 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/113 places, 463/486 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-09 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:(AND (NEQ s75 0) (NEQ s44 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 1342 reset in 453 ms.
Stack based approach found an accepted trace after 3219 steps with 45 reset with depth 33 and stack size 33 in 13 ms.
FORMULA Railroad-PT-020-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-09 finished in 1287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 486/486 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 112 transition count 486
Applied a total of 1 rules in 2 ms. Remains 112 /113 variables (removed 1) and now considering 486/486 (removed 0) transitions.
// Phase 1: matrix 486 rows 112 cols
[2022-05-20 21:35:09] [INFO ] Computed 26 place invariants in 4 ms
[2022-05-20 21:35:09] [INFO ] Implicit Places using invariants in 148 ms returned [9, 65]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 110/113 places, 486/486 transitions.
Applied a total of 0 rules in 1 ms. Remains 110 /110 variables (removed 0) and now considering 486/486 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 110/113 places, 486/486 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s12 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Railroad-PT-020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-020-LTLCardinality-11 finished in 238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U (G(!p0)||p1)))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 486/486 transitions.
Ensure Unique test removed 1 places
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 112 transition count 483
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 483
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 6 place count 109 transition count 465
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 42 place count 91 transition count 465
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 46 place count 89 transition count 463
Applied a total of 46 rules in 35 ms. Remains 89 /113 variables (removed 24) and now considering 463/486 (removed 23) transitions.
// Phase 1: matrix 463 rows 89 cols
[2022-05-20 21:35:10] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-20 21:35:10] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 463 rows 89 cols
[2022-05-20 21:35:10] [INFO ] Invariants computation overflowed in 1 ms
[2022-05-20 21:35:10] [INFO ] Implicit Places using invariants and state equation in 229 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/113 places, 463/486 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 86 transition count 462
Applied a total of 3 rules in 11 ms. Remains 86 /88 variables (removed 2) and now considering 462/463 (removed 1) transitions.
// Phase 1: matrix 462 rows 86 cols
[2022-05-20 21:35:10] [INFO ] Invariants computation overflowed in 2 ms
[2022-05-20 21:35:10] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 462 rows 86 cols
[2022-05-20 21:35:10] [INFO ] Invariants computation overflowed in 5 ms
[2022-05-20 21:35:10] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/113 places, 462/486 transitions.
Finished structural reductions, in 2 iterations. Remains : 86/113 places, 462/486 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : Railroad-PT-020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s23 0) (EQ s83 1)), p1:(NEQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2611 reset in 488 ms.
Stack based approach found an accepted trace after 217 steps with 7 reset with depth 16 and stack size 16 in 2 ms.
FORMULA Railroad-PT-020-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Railroad-PT-020-LTLCardinality-15 finished in 1309 ms.
All properties solved by simple procedures.
Total runtime 10143 ms.

BK_STOP 1653082511446

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Railroad-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Railroad-PT-020, 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 r186-tajo-165281572100307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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