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-165463873100566.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-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463873100566
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.3K Jun 7 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 7 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Jun 7 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 15:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 3 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K Jun 3 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 3 16:02 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Jun 7 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Jun 7 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 15:48 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 1.6M 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-10b-ReachabilityCardinality-00
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-01
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-02
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-03
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-04
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-05
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-06
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-07
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-08
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-09
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-10
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-11
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-12
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-13
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-14
FORMULA_NAME AutonomousCar-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654937385086

Running Version 202205111006
[2022-06-11 08:49:47] [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 08:49:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 08:49:47] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2022-06-11 08:49:47] [INFO ] Transformed 425 places.
[2022-06-11 08:49:47] [INFO ] Transformed 2252 transitions.
[2022-06-11 08:49:47] [INFO ] Found NUPN structural information;
[2022-06-11 08:49:47] [INFO ] Parsed PT model containing 425 places and 2252 transitions in 711 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 77 resets, run finished after 1104 ms. (steps per millisecond=9 ) properties (out of 15) seen :6
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 9) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2252 rows 425 cols
[2022-06-11 08:49:50] [INFO ] Computed 15 place invariants in 59 ms
[2022-06-11 08:49:51] [INFO ] After 603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-11 08:49:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 18 ms returned sat
[2022-06-11 08:49:52] [INFO ] After 1325ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2022-06-11 08:49:54] [INFO ] Deduced a trap composed of 30 places in 1641 ms of which 26 ms to minimize.
[2022-06-11 08:49:56] [INFO ] Deduced a trap composed of 103 places in 1589 ms of which 3 ms to minimize.
[2022-06-11 08:49:57] [INFO ] Deduced a trap composed of 48 places in 1431 ms of which 1 ms to minimize.
[2022-06-11 08:49:59] [INFO ] Deduced a trap composed of 37 places in 1400 ms of which 3 ms to minimize.
[2022-06-11 08:50:00] [INFO ] Deduced a trap composed of 43 places in 1681 ms of which 1 ms to minimize.
[2022-06-11 08:50:02] [INFO ] Deduced a trap composed of 50 places in 1384 ms of which 1 ms to minimize.
[2022-06-11 08:50:03] [INFO ] Deduced a trap composed of 50 places in 1121 ms of which 2 ms to minimize.
[2022-06-11 08:50:04] [INFO ] Deduced a trap composed of 52 places in 1124 ms of which 2 ms to minimize.
[2022-06-11 08:50:06] [INFO ] Deduced a trap composed of 56 places in 1128 ms of which 1 ms to minimize.
[2022-06-11 08:50:07] [INFO ] Deduced a trap composed of 54 places in 1054 ms of which 0 ms to minimize.
[2022-06-11 08:50:08] [INFO ] Deduced a trap composed of 51 places in 968 ms of which 1 ms to minimize.
[2022-06-11 08:50:09] [INFO ] Deduced a trap composed of 56 places in 992 ms of which 1 ms to minimize.
[2022-06-11 08:50:10] [INFO ] Deduced a trap composed of 53 places in 853 ms of which 0 ms to minimize.
[2022-06-11 08:50:11] [INFO ] Deduced a trap composed of 56 places in 799 ms of which 1 ms to minimize.
[2022-06-11 08:50:11] [INFO ] Deduced a trap composed of 56 places in 804 ms of which 1 ms to minimize.
[2022-06-11 08:50:13] [INFO ] Deduced a trap composed of 61 places in 1012 ms of which 1 ms to minimize.
[2022-06-11 08:50:14] [INFO ] Deduced a trap composed of 55 places in 924 ms of which 1 ms to minimize.
[2022-06-11 08:50:14] [INFO ] Deduced a trap composed of 55 places in 844 ms of which 1 ms to minimize.
[2022-06-11 08:50:15] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 22161 ms
[2022-06-11 08:50:15] [INFO ] After 23837ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 289 ms.
[2022-06-11 08:50:15] [INFO ] After 24453ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1258 ms.
Support contains 43 out of 425 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 425/425 places, 2252/2252 transitions.
Graph (trivial) has 337 edges and 425 vertex of which 4 / 425 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 1994 edges and 423 vertex of which 416 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.48 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 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 143 rules applied. Total rules applied 145 place count 416 transition count 2100
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 167 rules applied. Total rules applied 312 place count 275 transition count 2074
Reduce places removed 14 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 27 rules applied. Total rules applied 339 place count 261 transition count 2061
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 352 place count 248 transition count 2061
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 352 place count 248 transition count 2046
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 382 place count 233 transition count 2046
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 415 place count 200 transition count 2013
Iterating global reduction 4 with 33 rules applied. Total rules applied 448 place count 200 transition count 2013
Ensure Unique test removed 403 transitions
Reduce isomorphic transitions removed 403 transitions.
Iterating post reduction 4 with 403 rules applied. Total rules applied 851 place count 200 transition count 1610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 851 place count 200 transition count 1608
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 855 place count 198 transition count 1608
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 862 place count 191 transition count 1538
Iterating global reduction 5 with 7 rules applied. Total rules applied 869 place count 191 transition count 1538
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 5 rules applied. Total rules applied 874 place count 191 transition count 1533
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 876 place count 189 transition count 1533
Performed 46 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 46 places in 5 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 7 with 92 rules applied. Total rules applied 968 place count 143 transition count 1486
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 971 place count 140 transition count 1453
Iterating global reduction 7 with 3 rules applied. Total rules applied 974 place count 140 transition count 1453
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 7 with 2 rules applied. Total rules applied 976 place count 139 transition count 1453
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 981 place count 139 transition count 1448
Free-agglomeration rule applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 1001 place count 139 transition count 1428
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 1021 place count 119 transition count 1428
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1024 place count 119 transition count 1425
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1027 place count 119 transition count 1425
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1028 place count 118 transition count 1414
Iterating global reduction 8 with 1 rules applied. Total rules applied 1029 place count 118 transition count 1414
Applied a total of 1029 rules in 1366 ms. Remains 118 /425 variables (removed 307) and now considering 1414/2252 (removed 838) transitions.
Finished structural reductions, in 1 iterations. Remains : 118/425 places, 1414/2252 transitions.
Incomplete random walk after 1000000 steps, including 28423 resets, run finished after 16025 ms. (steps per millisecond=62 ) properties (out of 2) seen :1
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2960 resets, run finished after 4004 ms. (steps per millisecond=249 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1414 rows 118 cols
[2022-06-11 08:50:38] [INFO ] Computed 15 place invariants in 18 ms
[2022-06-11 08:50:38] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 08:50:38] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-11 08:50:39] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 08:50:39] [INFO ] State equation strengthened by 294 read => feed constraints.
[2022-06-11 08:50:39] [INFO ] After 76ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 08:50:40] [INFO ] Deduced a trap composed of 11 places in 748 ms of which 1 ms to minimize.
[2022-06-11 08:50:40] [INFO ] Deduced a trap composed of 11 places in 697 ms of which 1 ms to minimize.
[2022-06-11 08:50:41] [INFO ] Deduced a trap composed of 11 places in 714 ms of which 2 ms to minimize.
[2022-06-11 08:50:42] [INFO ] Deduced a trap composed of 11 places in 712 ms of which 1 ms to minimize.
[2022-06-11 08:50:43] [INFO ] Deduced a trap composed of 11 places in 724 ms of which 1 ms to minimize.
[2022-06-11 08:50:43] [INFO ] Deduced a trap composed of 11 places in 678 ms of which 0 ms to minimize.
[2022-06-11 08:50:44] [INFO ] Deduced a trap composed of 13 places in 624 ms of which 1 ms to minimize.
[2022-06-11 08:50:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5260 ms
[2022-06-11 08:50:44] [INFO ] After 5375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-06-11 08:50:44] [INFO ] After 6125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 344 ms.
Support contains 35 out of 118 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 118/118 places, 1414/1414 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 118 transition count 1409
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 113 transition count 1408
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 112 transition count 1407
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 112 transition count 1406
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 111 transition count 1406
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 109 transition count 1404
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 21 place count 109 transition count 1402
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 23 place count 109 transition count 1400
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 25 place count 107 transition count 1400
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 26 place count 107 transition count 1399
Applied a total of 26 rules in 431 ms. Remains 107 /118 variables (removed 11) and now considering 1399/1414 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/118 places, 1399/1414 transitions.
Incomplete random walk after 1000000 steps, including 29878 resets, run finished after 17404 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3212 resets, run finished after 4275 ms. (steps per millisecond=233 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12390620 steps, run timeout after 63001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 12390620 steps, saw 1613600 distinct states, run finished after 63009 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1399 rows 107 cols
[2022-06-11 08:52:10] [INFO ] Computed 15 place invariants in 14 ms
[2022-06-11 08:52:10] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 08:52:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-06-11 08:52:10] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 08:52:10] [INFO ] State equation strengthened by 294 read => feed constraints.
[2022-06-11 08:52:10] [INFO ] After 76ms SMT Verify possible using 294 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 08:52:11] [INFO ] Deduced a trap composed of 9 places in 932 ms of which 1 ms to minimize.
[2022-06-11 08:52:12] [INFO ] Deduced a trap composed of 11 places in 888 ms of which 1 ms to minimize.
[2022-06-11 08:52:13] [INFO ] Deduced a trap composed of 9 places in 869 ms of which 1 ms to minimize.
[2022-06-11 08:52:14] [INFO ] Deduced a trap composed of 11 places in 799 ms of which 1 ms to minimize.
[2022-06-11 08:52:15] [INFO ] Deduced a trap composed of 9 places in 894 ms of which 1 ms to minimize.
[2022-06-11 08:52:16] [INFO ] Deduced a trap composed of 11 places in 842 ms of which 1 ms to minimize.
[2022-06-11 08:52:17] [INFO ] Deduced a trap composed of 11 places in 839 ms of which 1 ms to minimize.
[2022-06-11 08:52:18] [INFO ] Deduced a trap composed of 8 places in 788 ms of which 2 ms to minimize.
[2022-06-11 08:52:18] [INFO ] Deduced a trap composed of 10 places in 713 ms of which 1 ms to minimize.
[2022-06-11 08:52:19] [INFO ] Deduced a trap composed of 11 places in 743 ms of which 1 ms to minimize.
[2022-06-11 08:52:20] [INFO ] Deduced a trap composed of 13 places in 705 ms of which 1 ms to minimize.
[2022-06-11 08:52:21] [INFO ] Deduced a trap composed of 13 places in 640 ms of which 2 ms to minimize.
[2022-06-11 08:52:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 10208 ms
[2022-06-11 08:52:21] [INFO ] After 10327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2022-06-11 08:52:21] [INFO ] After 11039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 309 ms.
Support contains 35 out of 107 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 1399/1399 transitions.
Applied a total of 0 rules in 99 ms. Remains 107 /107 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 107/107 places, 1399/1399 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 107/107 places, 1399/1399 transitions.
Applied a total of 0 rules in 97 ms. Remains 107 /107 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
// Phase 1: matrix 1399 rows 107 cols
[2022-06-11 08:52:21] [INFO ] Computed 15 place invariants in 10 ms
[2022-06-11 08:52:22] [INFO ] Implicit Places using invariants in 1075 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1095 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 106/107 places, 1399/1399 transitions.
Applied a total of 0 rules in 89 ms. Remains 106 /106 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 106/107 places, 1399/1399 transitions.
Incomplete random walk after 1000000 steps, including 30077 resets, run finished after 16328 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3170 resets, run finished after 4131 ms. (steps per millisecond=242 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12856778 steps, run timeout after 60001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 12856778 steps, saw 1669641 distinct states, run finished after 60002 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1399 rows 106 cols
[2022-06-11 08:53:43] [INFO ] Computed 14 place invariants in 10 ms
[2022-06-11 08:53:43] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 08:53:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2022-06-11 08:53:44] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 08:53:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:53:44] [INFO ] After 43ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 08:53:45] [INFO ] Deduced a trap composed of 11 places in 912 ms of which 5 ms to minimize.
[2022-06-11 08:53:46] [INFO ] Deduced a trap composed of 11 places in 800 ms of which 1 ms to minimize.
[2022-06-11 08:53:46] [INFO ] Deduced a trap composed of 11 places in 775 ms of which 1 ms to minimize.
[2022-06-11 08:53:47] [INFO ] Deduced a trap composed of 10 places in 702 ms of which 0 ms to minimize.
[2022-06-11 08:53:48] [INFO ] Deduced a trap composed of 11 places in 640 ms of which 1 ms to minimize.
[2022-06-11 08:53:48] [INFO ] Deduced a trap composed of 13 places in 589 ms of which 1 ms to minimize.
[2022-06-11 08:53:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4693 ms
[2022-06-11 08:53:49] [INFO ] After 4770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-06-11 08:53:49] [INFO ] After 5469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 295 ms.
Support contains 35 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 1399/1399 transitions.
Applied a total of 0 rules in 97 ms. Remains 106 /106 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 1399/1399 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 1399/1399 transitions.
Applied a total of 0 rules in 95 ms. Remains 106 /106 variables (removed 0) and now considering 1399/1399 (removed 0) transitions.
// Phase 1: matrix 1399 rows 106 cols
[2022-06-11 08:53:49] [INFO ] Computed 14 place invariants in 8 ms
[2022-06-11 08:53:50] [INFO ] Implicit Places using invariants in 685 ms returned []
// Phase 1: matrix 1399 rows 106 cols
[2022-06-11 08:53:50] [INFO ] Computed 14 place invariants in 8 ms
[2022-06-11 08:53:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-11 08:53:51] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned [97]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2018 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 105/106 places, 1399/1399 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 1397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 1397
Applied a total of 4 rules in 181 ms. Remains 103 /105 variables (removed 2) and now considering 1397/1399 (removed 2) transitions.
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:53:51] [INFO ] Computed 13 place invariants in 9 ms
[2022-06-11 08:53:52] [INFO ] Implicit Places using invariants in 602 ms returned []
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:53:52] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:53:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:53:53] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1924 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 103/106 places, 1397/1399 transitions.
Finished structural reductions, in 2 iterations. Remains : 103/106 places, 1397/1399 transitions.
Incomplete random walk after 1000000 steps, including 30573 resets, run finished after 16343 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3262 resets, run finished after 4046 ms. (steps per millisecond=247 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 12464315 steps, run timeout after 60001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 12464315 steps, saw 1622231 distinct states, run finished after 60001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:55:14] [INFO ] Computed 13 place invariants in 9 ms
[2022-06-11 08:55:14] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 08:55:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-06-11 08:55:14] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 08:55:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:55:14] [INFO ] After 42ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 08:55:15] [INFO ] Deduced a trap composed of 9 places in 966 ms of which 2 ms to minimize.
[2022-06-11 08:55:16] [INFO ] Deduced a trap composed of 11 places in 868 ms of which 1 ms to minimize.
[2022-06-11 08:55:17] [INFO ] Deduced a trap composed of 9 places in 911 ms of which 1 ms to minimize.
[2022-06-11 08:55:18] [INFO ] Deduced a trap composed of 11 places in 860 ms of which 2 ms to minimize.
[2022-06-11 08:55:19] [INFO ] Deduced a trap composed of 9 places in 826 ms of which 1 ms to minimize.
[2022-06-11 08:55:20] [INFO ] Deduced a trap composed of 11 places in 789 ms of which 1 ms to minimize.
[2022-06-11 08:55:21] [INFO ] Deduced a trap composed of 9 places in 814 ms of which 1 ms to minimize.
[2022-06-11 08:55:21] [INFO ] Deduced a trap composed of 11 places in 773 ms of which 1 ms to minimize.
[2022-06-11 08:55:22] [INFO ] Deduced a trap composed of 8 places in 776 ms of which 1 ms to minimize.
[2022-06-11 08:55:23] [INFO ] Deduced a trap composed of 10 places in 706 ms of which 1 ms to minimize.
[2022-06-11 08:55:24] [INFO ] Deduced a trap composed of 11 places in 732 ms of which 0 ms to minimize.
[2022-06-11 08:55:25] [INFO ] Deduced a trap composed of 13 places in 673 ms of which 1 ms to minimize.
[2022-06-11 08:55:25] [INFO ] Deduced a trap composed of 13 places in 579 ms of which 1 ms to minimize.
[2022-06-11 08:55:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 10832 ms
[2022-06-11 08:55:25] [INFO ] After 10909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-11 08:55:25] [INFO ] After 11567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 280 ms.
Support contains 35 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 1397/1397 transitions.
Applied a total of 0 rules in 92 ms. Remains 103 /103 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 1397/1397 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 1397/1397 transitions.
Applied a total of 0 rules in 89 ms. Remains 103 /103 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:55:26] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:55:26] [INFO ] Implicit Places using invariants in 619 ms returned []
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:55:26] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:55:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:55:27] [INFO ] Implicit Places using invariants and state equation in 1122 ms returned []
Implicit Place search using SMT with State Equation took 1758 ms to find 0 implicit places.
[2022-06-11 08:55:28] [INFO ] Redundant transitions in 225 ms returned []
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:55:28] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:55:29] [INFO ] Dead Transitions using invariants and state equation in 1168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 1397/1397 transitions.
Incomplete random walk after 1000000 steps, including 30782 resets, run finished after 16265 ms. (steps per millisecond=61 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3198 resets, run finished after 3996 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13023767 steps, run timeout after 60001 ms. (steps per millisecond=217 ) properties seen :{}
Probabilistic random walk after 13023767 steps, saw 1692659 distinct states, run finished after 60003 ms. (steps per millisecond=217 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:56:49] [INFO ] Computed 13 place invariants in 9 ms
[2022-06-11 08:56:49] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 08:56:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-06-11 08:56:50] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 08:56:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:56:50] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 08:56:51] [INFO ] Deduced a trap composed of 9 places in 948 ms of which 1 ms to minimize.
[2022-06-11 08:56:52] [INFO ] Deduced a trap composed of 11 places in 869 ms of which 1 ms to minimize.
[2022-06-11 08:56:53] [INFO ] Deduced a trap composed of 9 places in 934 ms of which 2 ms to minimize.
[2022-06-11 08:56:54] [INFO ] Deduced a trap composed of 11 places in 866 ms of which 4 ms to minimize.
[2022-06-11 08:56:55] [INFO ] Deduced a trap composed of 9 places in 867 ms of which 1 ms to minimize.
[2022-06-11 08:56:55] [INFO ] Deduced a trap composed of 11 places in 801 ms of which 1 ms to minimize.
[2022-06-11 08:56:56] [INFO ] Deduced a trap composed of 9 places in 831 ms of which 2 ms to minimize.
[2022-06-11 08:56:57] [INFO ] Deduced a trap composed of 11 places in 778 ms of which 1 ms to minimize.
[2022-06-11 08:56:58] [INFO ] Deduced a trap composed of 8 places in 771 ms of which 1 ms to minimize.
[2022-06-11 08:56:59] [INFO ] Deduced a trap composed of 10 places in 718 ms of which 1 ms to minimize.
[2022-06-11 08:56:59] [INFO ] Deduced a trap composed of 11 places in 724 ms of which 1 ms to minimize.
[2022-06-11 08:57:00] [INFO ] Deduced a trap composed of 13 places in 686 ms of which 1 ms to minimize.
[2022-06-11 08:57:01] [INFO ] Deduced a trap composed of 13 places in 640 ms of which 0 ms to minimize.
[2022-06-11 08:57:01] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 10986 ms
[2022-06-11 08:57:01] [INFO ] After 11065ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2022-06-11 08:57:01] [INFO ] After 11726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 291 ms.
Support contains 35 out of 103 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 1397/1397 transitions.
Applied a total of 0 rules in 102 ms. Remains 103 /103 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 1397/1397 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 103/103 places, 1397/1397 transitions.
Applied a total of 0 rules in 89 ms. Remains 103 /103 variables (removed 0) and now considering 1397/1397 (removed 0) transitions.
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:57:01] [INFO ] Computed 13 place invariants in 9 ms
[2022-06-11 08:57:02] [INFO ] Implicit Places using invariants in 671 ms returned []
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:57:02] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:57:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-11 08:57:03] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2022-06-11 08:57:03] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:57:03] [INFO ] Computed 13 place invariants in 8 ms
[2022-06-11 08:57:05] [INFO ] Dead Transitions using invariants and state equation in 1361 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 103/103 places, 1397/1397 transitions.
Graph (complete) has 1117 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 1396
Applied a total of 2 rules in 152 ms. Remains 102 /103 variables (removed 1) and now considering 1396/1397 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1396 rows 102 cols
[2022-06-11 08:57:05] [INFO ] Computed 12 place invariants in 8 ms
[2022-06-11 08:57:05] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 08:57:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2022-06-11 08:57:06] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 08:57:07] [INFO ] Deduced a trap composed of 11 places in 836 ms of which 1 ms to minimize.
[2022-06-11 08:57:07] [INFO ] Deduced a trap composed of 11 places in 787 ms of which 1 ms to minimize.
[2022-06-11 08:57:08] [INFO ] Deduced a trap composed of 11 places in 757 ms of which 1 ms to minimize.
[2022-06-11 08:57:09] [INFO ] Deduced a trap composed of 11 places in 703 ms of which 1 ms to minimize.
[2022-06-11 08:57:10] [INFO ] Deduced a trap composed of 11 places in 743 ms of which 1 ms to minimize.
[2022-06-11 08:57:10] [INFO ] Deduced a trap composed of 11 places in 651 ms of which 1 ms to minimize.
[2022-06-11 08:57:11] [INFO ] Deduced a trap composed of 13 places in 595 ms of which 0 ms to minimize.
[2022-06-11 08:57:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5391 ms
[2022-06-11 08:57:11] [INFO ] After 5983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-06-11 08:57:11] [INFO ] After 6073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 08:57:12] [INFO ] Flatten gal took : 660 ms
[2022-06-11 08:57:13] [INFO ] Flatten gal took : 376 ms
[2022-06-11 08:57:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11825416335948330125.gal : 74 ms
[2022-06-11 08:57:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12074151465021263605.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/ReachabilityCardinality11825416335948330125.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12074151465021263605.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/ReachabilityCardinality12074151465021263605.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 115
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :115 after 1175
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1175 after 58965
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :58965 after 151177
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :151177 after 3.84054e+06
Detected timeout of ITS tools.
[2022-06-11 08:57:28] [INFO ] Flatten gal took : 342 ms
[2022-06-11 08:57:28] [INFO ] Applying decomposition
[2022-06-11 08:57:28] [INFO ] Flatten gal took : 326 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17865973916669516998.txt' '-o' '/tmp/graph17865973916669516998.bin' '-w' '/tmp/graph17865973916669516998.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17865973916669516998.bin' '-l' '-1' '-v' '-w' '/tmp/graph17865973916669516998.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:57:30] [INFO ] Decomposing Gal with order
[2022-06-11 08:57:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:57:31] [INFO ] Removed a total of 12286 redundant transitions.
[2022-06-11 08:57:31] [INFO ] Flatten gal took : 830 ms
[2022-06-11 08:57:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 129 labels/synchronizations in 134 ms.
[2022-06-11 08:57:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15614498503687100975.gal : 20 ms
[2022-06-11 08:57:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10116321880461214870.prop : 2 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/ReachabilityCardinality15614498503687100975.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10116321880461214870.prop' '--nowitness'

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...300
Loading property file /tmp/ReachabilityCardinality10116321880461214870.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 23
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :23 after 237
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :237 after 2.32522e+07
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.32522e+07 after 7.01545e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.01545e+07 after 1.20454e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.20454e+08 after 2.40194e+08
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9952249336736805392
[2022-06-11 08:57:46] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9952249336736805392
Running compilation step : cd /tmp/ltsmin9952249336736805392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9952249336736805392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9952249336736805392;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 08:57:49] [INFO ] Flatten gal took : 280 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14026060194522637177
[2022-06-11 08:57:50] [INFO ] Computing symmetric may disable matrix : 1397 transitions.
[2022-06-11 08:57:50] [INFO ] Applying decomposition
[2022-06-11 08:57:50] [INFO ] Flatten gal took : 503 ms
[2022-06-11 08:57:50] [INFO ] Computation of Complete disable matrix. took 690 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:57:51] [INFO ] Flatten gal took : 655 ms
[2022-06-11 08:57:51] [INFO ] Input system was already deterministic with 1397 transitions.
[2022-06-11 08:57:51] [INFO ] Computing symmetric may enable matrix : 1397 transitions.
[2022-06-11 08:57:51] [INFO ] Computation of Complete enable matrix. took 399 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3026767116298158135.txt' '-o' '/tmp/graph3026767116298158135.bin' '-w' '/tmp/graph3026767116298158135.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3026767116298158135.bin' '-l' '-1' '-v' '-w' '/tmp/graph3026767116298158135.weights' '-q' '0' '-e' '0.001'
[2022-06-11 08:57:52] [INFO ] Decomposing Gal with order
[2022-06-11 08:57:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 08:57:52] [INFO ] Computing Do-Not-Accords matrix : 1397 transitions.
[2022-06-11 08:57:52] [INFO ] Computation of Completed DNA matrix. took 272 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-11 08:57:52] [INFO ] Built C files in 2863ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14026060194522637177
Running compilation step : cd /tmp/ltsmin14026060194522637177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 08:57:53] [INFO ] Removed a total of 12290 redundant transitions.
[2022-06-11 08:57:53] [INFO ] Flatten gal took : 962 ms
[2022-06-11 08:57:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 132 labels/synchronizations in 143 ms.
[2022-06-11 08:57:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10753660707299130240.gal : 7 ms
[2022-06-11 08:57:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality569164937725221013.prop : 2 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/ReachabilityCardinality10753660707299130240.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality569164937725221013.prop' '--nowitness'

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...298
Loading property file /tmp/ReachabilityCardinality569164937725221013.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 47
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :47 after 190
[2022-06-11 08:57:53] [INFO ] Ran tautology test, simplified 0 / 1 in 3148 ms.
[2022-06-11 08:57:53] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=0 took 36 ms
[2022-06-11 08:57:53] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=1 took 19 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :190 after 2.40779e+07
[2022-06-11 08:57:54] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=2 took 573 ms
[2022-06-11 08:57:55] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=3 took 471 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 1397 rows 103 cols
[2022-06-11 08:57:56] [INFO ] Computed 13 place invariants in 23 ms
[2022-06-11 08:57:56] [INFO ] Computed 13 place invariants in 24 ms
[2022-06-11 08:57:56] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=4 took 849 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.40779e+07 after 8.28342e+07
[2022-06-11 08:57:56] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=5 took 573 ms
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8.28342e+07 after 8.29252e+07
[2022-06-11 08:57:59] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=6 took 2429 ms
Compilation finished in 20113 ms.
Running link step : cd /tmp/ltsmin14026060194522637177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :8.29252e+07 after 1.42546e+08
Link finished in 527 ms.
Running LTSmin : cd /tmp/ltsmin14026060194522637177;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'AutonomousCarPT10bReachabilityCardinality00==true'
[2022-06-11 08:58:14] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=7 took 14964 ms
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.42546e+08 after 1.82902e+08
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.82902e+08 after 2.40054e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.40054e+08 after 8.82027e+08
[2022-06-11 09:01:01] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=8 took 166926 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :8.82027e+08 after 4.9342e+09
[2022-06-11 09:01:58] [INFO ] Proved 103 variables to be positive in 242448 ms
[2022-06-11 09:01:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesAutonomousCar-PT-10b-ReachabilityCardinality-00
[2022-06-11 09:01:58] [INFO ] KInduction solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(SAT) depth K=0 took 53 ms
[2022-06-11 09:02:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesAutonomousCar-PT-10b-ReachabilityCardinality-00
[2022-06-11 09:02:05] [INFO ] KInduction solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(SAT) depth K=1 took 6572 ms
[2022-06-11 09:02:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesAutonomousCar-PT-10b-ReachabilityCardinality-00
[2022-06-11 09:02:38] [INFO ] KInduction solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(SAT) depth K=2 took 33006 ms
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.9342e+09 after 1.07466e+10
[2022-06-11 09:06:49] [INFO ] BMC solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(UNSAT) depth K=9 took 348543 ms
[2022-06-11 09:07:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesAutonomousCar-PT-10b-ReachabilityCardinality-00
[2022-06-11 09:07:18] [INFO ] KInduction solution for property AutonomousCar-PT-10b-ReachabilityCardinality-00(SAT) depth K=3 took 279129 ms
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\_mod\_flat,4.08143e+10,386.32,2376076,8442,1700,1.15614e+06,136774,639,2.6635e+07,222,1.44309e+06,0
Total reachable state count : 40814330441

Verifying 1 reachability properties.
Invariant property AutonomousCar-PT-10b-ReachabilityCardinality-00 is true.
FORMULA AutonomousCar-PT-10b-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-10b-ReachabilityCardinality-00,0,389.208,2311340,1,0,1.15614e+06,136774,734,2.6635e+07,238,1.44309e+06,46495
[2022-06-11 09:15:11] [WARNING] Interrupting SMT solver.
[2022-06-11 09:15:11] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 09:15:11] [WARNING] Unexpected error occurred while running SMT. Was verifying AutonomousCar-PT-10b-ReachabilityCardinality-00 K-induction depth 4
Exception in thread "Thread-12" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 09:15:11] [WARNING] Unexpected error occurred while running SMT. Was verifying AutonomousCar-PT-10b-ReachabilityCardinality-00 SMT depth 10
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-11 09:15:11] [INFO ] During BMC, SMT solver timed out at depth 10
[2022-06-11 09:15:11] [INFO ] BMC solving timed out (3600000 secs) at depth 10
[2022-06-11 09:15:11] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1524491 ms.

BK_STOP 1654938911695

--------------------
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-10b"
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-10b, 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-165463873100566"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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