Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463873100550.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutonomousCar-PT-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873100550
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.7K Jun 7 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 7 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 7 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 3 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 3 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 3 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 3 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 16K Jun 7 15:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Jun 7 15:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Jun 7 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 3 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 3 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 3 16:02 instance
-rw-r--r-- 1 mcc users 6 Jun 3 16:02 iscolored
-rw-r--r-- 1 mcc users 865K Jun 3 16:02 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 AutonomousCar-PT-09b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654926055937

Running Version 202205111006
[2022-06-11 05:40:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-06-11 05:40:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 05:40:58] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2022-06-11 05:40:58] [INFO ] Transformed 391 places.
[2022-06-11 05:40:58] [INFO ] Transformed 1554 transitions.
[2022-06-11 05:40:58] [INFO ] Found NUPN structural information;
[2022-06-11 05:40:58] [INFO ] Parsed PT model containing 391 places and 1554 transitions in 542 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 82 resets, run finished after 994 ms. (steps per millisecond=10 ) properties (out of 14) seen :6
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1554 rows 391 cols
[2022-06-11 05:41:00] [INFO ] Computed 14 place invariants in 44 ms
[2022-06-11 05:41:01] [INFO ] After 515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-11 05:41:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2022-06-11 05:41:03] [INFO ] After 1414ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2022-06-11 05:41:04] [INFO ] Deduced a trap composed of 36 places in 394 ms of which 16 ms to minimize.
[2022-06-11 05:41:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 535 ms
[2022-06-11 05:41:05] [INFO ] Deduced a trap composed of 12 places in 998 ms of which 1 ms to minimize.
[2022-06-11 05:41:06] [INFO ] Deduced a trap composed of 35 places in 830 ms of which 1 ms to minimize.
[2022-06-11 05:41:07] [INFO ] Deduced a trap composed of 17 places in 892 ms of which 2 ms to minimize.
[2022-06-11 05:41:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2944 ms
[2022-06-11 05:41:07] [INFO ] After 5260ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 329 ms.
[2022-06-11 05:41:07] [INFO ] After 5893ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 791 ms.
Support contains 36 out of 391 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 303 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 9 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1699 edges and 389 vertex of which 382 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.33 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 122 rules applied. Total rules applied 124 place count 382 transition count 1423
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 140 rules applied. Total rules applied 264 place count 262 transition count 1403
Reduce places removed 11 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 25 rules applied. Total rules applied 289 place count 251 transition count 1389
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 16 rules applied. Total rules applied 305 place count 237 transition count 1387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 306 place count 236 transition count 1387
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 18 Pre rules applied. Total rules applied 306 place count 236 transition count 1369
Deduced a syphon composed of 18 places in 4 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 342 place count 218 transition count 1369
Discarding 35 places :
Symmetric choice reduction at 5 with 35 rule applications. Total rules 377 place count 183 transition count 1334
Iterating global reduction 5 with 35 rules applied. Total rules applied 412 place count 183 transition count 1334
Ensure Unique test removed 328 transitions
Reduce isomorphic transitions removed 328 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 329 rules applied. Total rules applied 741 place count 183 transition count 1005
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 742 place count 182 transition count 1005
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 742 place count 182 transition count 1003
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 746 place count 180 transition count 1003
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 755 place count 171 transition count 930
Iterating global reduction 7 with 9 rules applied. Total rules applied 764 place count 171 transition count 930
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 768 place count 171 transition count 926
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 769 place count 170 transition count 926
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 9 with 78 rules applied. Total rules applied 847 place count 131 transition count 886
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 853 place count 125 transition count 826
Iterating global reduction 9 with 6 rules applied. Total rules applied 859 place count 125 transition count 826
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 861 place count 124 transition count 826
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 862 place count 124 transition count 825
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 867 place count 124 transition count 820
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 879 place count 124 transition count 808
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 891 place count 112 transition count 808
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 894 place count 112 transition count 805
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 896 place count 112 transition count 805
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 897 place count 112 transition count 805
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 898 place count 111 transition count 804
Applied a total of 898 rules in 806 ms. Remains 111 /391 variables (removed 280) and now considering 804/1554 (removed 750) transitions.
Finished structural reductions, in 1 iterations. Remains : 111/391 places, 804/1554 transitions.
Incomplete random walk after 1000000 steps, including 26833 resets, run finished after 7764 ms. (steps per millisecond=128 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3302 resets, run finished after 1453 ms. (steps per millisecond=688 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 804 rows 111 cols
[2022-06-11 05:41:18] [INFO ] Computed 14 place invariants in 8 ms
[2022-06-11 05:41:18] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 05:41:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2022-06-11 05:41:18] [INFO ] After 316ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 05:41:18] [INFO ] State equation strengthened by 201 read => feed constraints.
[2022-06-11 05:41:18] [INFO ] After 50ms SMT Verify possible using 201 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 05:41:19] [INFO ] Deduced a trap composed of 11 places in 633 ms of which 1 ms to minimize.
[2022-06-11 05:41:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 694 ms
[2022-06-11 05:41:19] [INFO ] After 771ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-11 05:41:19] [INFO ] After 1172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 84 ms.
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 111/111 places, 804/804 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 111 transition count 785
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 44 place count 92 transition count 779
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 90 transition count 777
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 88 transition count 776
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 51 place count 88 transition count 775
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 53 place count 87 transition count 775
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 86 transition count 765
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 86 transition count 765
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 73 place count 77 transition count 756
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 77 transition count 750
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 85 place count 71 transition count 750
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 87 place count 69 transition count 748
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 68 transition count 748
Applied a total of 88 rules in 190 ms. Remains 68 /111 variables (removed 43) and now considering 748/804 (removed 56) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/111 places, 748/804 transitions.
Incomplete random walk after 1000000 steps, including 16410 resets, run finished after 12301 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2105 resets, run finished after 2051 ms. (steps per millisecond=487 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 16797165 steps, run timeout after 42001 ms. (steps per millisecond=399 ) properties seen :{}
Probabilistic random walk after 16797165 steps, saw 1805444 distinct states, run finished after 42004 ms. (steps per millisecond=399 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 748 rows 68 cols
[2022-06-11 05:42:16] [INFO ] Computed 13 place invariants in 7 ms
[2022-06-11 05:42:16] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 05:42:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-06-11 05:42:16] [INFO ] After 251ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 05:42:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 05:42:16] [INFO ] After 24ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 05:42:17] [INFO ] Deduced a trap composed of 5 places in 515 ms of which 1 ms to minimize.
[2022-06-11 05:42:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 560 ms
[2022-06-11 05:42:17] [INFO ] After 602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-11 05:42:17] [INFO ] After 918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 127 ms.
Support contains 8 out of 68 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 68/68 places, 748/748 transitions.
Applied a total of 0 rules in 44 ms. Remains 68 /68 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 748/748 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 68/68 places, 748/748 transitions.
Applied a total of 0 rules in 42 ms. Remains 68 /68 variables (removed 0) and now considering 748/748 (removed 0) transitions.
// Phase 1: matrix 748 rows 68 cols
[2022-06-11 05:42:17] [INFO ] Computed 13 place invariants in 7 ms
[2022-06-11 05:42:17] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 748 rows 68 cols
[2022-06-11 05:42:17] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 05:42:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 05:42:18] [INFO ] Implicit Places using invariants and state equation in 595 ms returned [59, 65]
Discarding 2 places :
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1020 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 66/68 places, 747/748 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 746
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 746
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 65 transition count 745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 64 transition count 745
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 64 transition count 745
Applied a total of 5 rules in 134 ms. Remains 64 /66 variables (removed 2) and now considering 745/747 (removed 2) transitions.
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:42:18] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-11 05:42:18] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:42:18] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-11 05:42:19] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 64/68 places, 745/748 transitions.
Finished structural reductions, in 2 iterations. Remains : 64/68 places, 745/748 transitions.
Incomplete random walk after 1000000 steps, including 1274 resets, run finished after 11925 ms. (steps per millisecond=83 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 187 resets, run finished after 2016 ms. (steps per millisecond=496 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 15801194 steps, run timeout after 39001 ms. (steps per millisecond=405 ) properties seen :{}
Probabilistic random walk after 15801194 steps, saw 1715599 distinct states, run finished after 39001 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:43:12] [INFO ] Computed 11 place invariants in 4 ms
[2022-06-11 05:43:12] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 05:43:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-06-11 05:43:12] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 05:43:13] [INFO ] Deduced a trap composed of 5 places in 804 ms of which 1 ms to minimize.
[2022-06-11 05:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 874 ms
[2022-06-11 05:43:13] [INFO ] After 1272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-11 05:43:13] [INFO ] After 1347ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 177 ms.
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 745/745 transitions.
Applied a total of 0 rules in 61 ms. Remains 64 /64 variables (removed 0) and now considering 745/745 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 745/745 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 745/745 transitions.
Applied a total of 0 rules in 63 ms. Remains 64 /64 variables (removed 0) and now considering 745/745 (removed 0) transitions.
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:43:14] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-11 05:43:14] [INFO ] Implicit Places using invariants in 496 ms returned []
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:43:14] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-11 05:43:15] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1344 ms to find 0 implicit places.
[2022-06-11 05:43:15] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:43:15] [INFO ] Computed 11 place invariants in 6 ms
[2022-06-11 05:43:16] [INFO ] Dead Transitions using invariants and state equation in 693 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 745/745 transitions.
Incomplete random walk after 1000000 steps, including 1279 resets, run finished after 12336 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 136 resets, run finished after 2009 ms. (steps per millisecond=497 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 17010550 steps, run timeout after 42001 ms. (steps per millisecond=405 ) properties seen :{}
Probabilistic random walk after 17010550 steps, saw 1836246 distinct states, run finished after 42001 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:44:12] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 05:44:12] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 05:44:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-11 05:44:13] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 05:44:14] [INFO ] Deduced a trap composed of 5 places in 853 ms of which 1 ms to minimize.
[2022-06-11 05:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 917 ms
[2022-06-11 05:44:14] [INFO ] After 1305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-11 05:44:14] [INFO ] After 1390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 190 ms.
Support contains 8 out of 64 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 745/745 transitions.
Applied a total of 0 rules in 64 ms. Remains 64 /64 variables (removed 0) and now considering 745/745 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 745/745 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 64/64 places, 745/745 transitions.
Applied a total of 0 rules in 63 ms. Remains 64 /64 variables (removed 0) and now considering 745/745 (removed 0) transitions.
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:44:14] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 05:44:14] [INFO ] Implicit Places using invariants in 490 ms returned []
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:44:14] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 05:44:15] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2022-06-11 05:44:15] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:44:15] [INFO ] Computed 11 place invariants in 5 ms
[2022-06-11 05:44:16] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 64/64 places, 745/745 transitions.
Applied a total of 0 rules in 62 ms. Remains 64 /64 variables (removed 0) and now considering 745/745 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 745 rows 64 cols
[2022-06-11 05:44:16] [INFO ] Computed 11 place invariants in 10 ms
[2022-06-11 05:44:16] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 05:44:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-11 05:44:17] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 05:44:18] [INFO ] Deduced a trap composed of 5 places in 826 ms of which 1 ms to minimize.
[2022-06-11 05:44:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 892 ms
[2022-06-11 05:44:18] [INFO ] After 1297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2022-06-11 05:44:18] [INFO ] After 1380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 05:44:19] [INFO ] Flatten gal took : 564 ms
[2022-06-11 05:44:19] [INFO ] Flatten gal took : 269 ms
[2022-06-11 05:44:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15418404495811019940.gal : 64 ms
[2022-06-11 05:44:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15232003895739086083.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15418404495811019940.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15232003895739086083.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality15232003895739086083.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 213
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :213 after 665
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :665 after 4619
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4619 after 558697
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :558697 after 712009
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :712009 after 1.01863e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.01863e+06 after 1.63188e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.63188e+06 after 4.26058e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.9998e+07 after 5.41442e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.07013e+08,5.7968,118980,2,3239,18,326282,7,0,1015,342464,0
Total reachable state count : 107012745

Verifying 1 reachability properties.
Invariant property AutonomousCar-PT-09b-ReachabilityCardinality-05 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutonomousCar-PT-09b-ReachabilityCardinality-05,0,5.80089,118980,1,0,18,326282,7,0,1024,342464,0
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-05 TRUE TECHNIQUES OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 207599 ms.

BK_STOP 1654926265351

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="AutonomousCar-PT-09b"
export BK_EXAMINATION="ReachabilityCardinality"
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 AutonomousCar-PT-09b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r294-smll-165463873100550"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-09b.tgz
mv AutonomousCar-PT-09b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;