fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853600695
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Peterson-COL-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.500 3600000.00 254589.00 123.70 FTTTTTTTTFTTFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853600695.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itslola
Input is Peterson-COL-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853600695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 46K Apr 27 15:14 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 Peterson-COL-6-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591163404755

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:50:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:50:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:50:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 05:50:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 712 ms
[2020-06-03 05:50:07] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-06-03 05:50:07] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 21 ms.
[2020-06-03 05:50:07] [INFO ] Computed order based on color domains.
[2020-06-03 05:50:07] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions in 55 ms.
[2020-06-03 05:50:07] [INFO ] Unfolded HLPN properties in 2 ms.
Deduced a syphon composed of 42 places in 17 ms
Reduce places removed 42 places and 84 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 160 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 408 ms. (steps per millisecond=24 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1]
FORMULA Peterson-COL-6-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 125 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 430 ms. (steps per millisecond=23 ) properties seen :[0, 0, 1, 0, 0]
FORMULA Peterson-COL-6-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 594 ms. (steps per millisecond=16 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 120 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0]
[2020-06-03 05:50:09] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2020-06-03 05:50:09] [INFO ] Computed 27 place invariants in 77 ms
[2020-06-03 05:50:10] [INFO ] [Real]Absence check using 20 positive place invariants in 94 ms returned sat
[2020-06-03 05:50:10] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 39 ms returned sat
[2020-06-03 05:50:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:50:14] [INFO ] [Real]Absence check using state equation in 4585 ms returned (error "Failed to check-sat")
[2020-06-03 05:50:15] [INFO ] [Real]Absence check using 20 positive place invariants in 77 ms returned sat
[2020-06-03 05:50:15] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 33 ms returned sat
[2020-06-03 05:50:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:50:19] [INFO ] [Real]Absence check using state equation in 4678 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 05:50:20] [INFO ] [Real]Absence check using 20 positive place invariants in 89 ms returned sat
[2020-06-03 05:50:20] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 40 ms returned sat
[2020-06-03 05:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:50:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:50:24] [INFO ] [Real]Absence check using state equation in 4581 ms returned (error "Failed to check-sat")
[2020-06-03 05:50:25] [INFO ] [Real]Absence check using 20 positive place invariants in 77 ms returned sat
[2020-06-03 05:50:25] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 53 ms returned sat
[2020-06-03 05:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:50:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:50:29] [INFO ] [Real]Absence check using state equation in 4706 ms returned unknown
Support contains 742 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 216 Post agglomeration using F-continuation condition.Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 1330 transition count 1814
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 432 place count 1114 transition count 1814
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 432 place count 1114 transition count 1778
Deduced a syphon composed of 36 places in 6 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 504 place count 1078 transition count 1778
Applied a total of 504 rules in 474 ms. Remains 1078 /1330 variables (removed 252) and now considering 1778/2030 (removed 252) transitions.
Finished structural reductions, in 1 iterations. Remains : 1078/1330 places, 1778/2030 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12694 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2579 ms. (steps per millisecond=387 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 2603 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 114456 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=22 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 635144 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=127 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 6169696 steps, run timeout after 30001 ms. (steps per millisecond=205 ) properties seen :[1, 1, 0, 1]
Probabilistic random walk after 6169696 steps, saw 771213 distinct states, run finished after 30003 ms. (steps per millisecond=205 ) properties seen :[1, 1, 0, 1]
FORMULA Peterson-COL-6-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2020-06-03 05:51:28] [INFO ] Flow matrix only has 1568 transitions (discarded 210 similar events)
// Phase 1: matrix 1568 rows 1078 cols
[2020-06-03 05:51:28] [INFO ] Computed 27 place invariants in 20 ms
[2020-06-03 05:51:28] [INFO ] [Real]Absence check using 20 positive place invariants in 68 ms returned sat
[2020-06-03 05:51:28] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 29 ms returned sat
[2020-06-03 05:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:51:34] [INFO ] [Real]Absence check using state equation in 6513 ms returned sat
[2020-06-03 05:51:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:51:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 133 ms returned sat
[2020-06-03 05:51:35] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 30 ms returned sat
[2020-06-03 05:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:51:41] [INFO ] [Nat]Absence check using state equation in 5615 ms returned sat
[2020-06-03 05:51:41] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 05:51:41] [INFO ] [Nat]Added 366 Read/Feed constraints in 109 ms returned sat
[2020-06-03 05:51:42] [INFO ] Deduced a trap composed of 91 places in 1021 ms
[2020-06-03 05:51:43] [INFO ] Deduced a trap composed of 53 places in 907 ms
[2020-06-03 05:51:44] [INFO ] Deduced a trap composed of 26 places in 889 ms
[2020-06-03 05:51:45] [INFO ] Deduced a trap composed of 71 places in 1130 ms
[2020-06-03 05:51:47] [INFO ] Deduced a trap composed of 62 places in 1160 ms
[2020-06-03 05:51:47] [INFO ] Deduced a trap composed of 125 places in 593 ms
[2020-06-03 05:51:48] [INFO ] Deduced a trap composed of 219 places in 588 ms
[2020-06-03 05:51:49] [INFO ] Deduced a trap composed of 50 places in 640 ms
[2020-06-03 05:51:50] [INFO ] Deduced a trap composed of 50 places in 680 ms
[2020-06-03 05:51:50] [INFO ] Deduced a trap composed of 219 places in 680 ms
[2020-06-03 05:51:51] [INFO ] Deduced a trap composed of 125 places in 622 ms
[2020-06-03 05:51:52] [INFO ] Deduced a trap composed of 119 places in 739 ms
[2020-06-03 05:51:53] [INFO ] Deduced a trap composed of 125 places in 661 ms
[2020-06-03 05:51:53] [INFO ] Deduced a trap composed of 223 places in 654 ms
[2020-06-03 05:51:54] [INFO ] Deduced a trap composed of 125 places in 587 ms
[2020-06-03 05:51:55] [INFO ] Deduced a trap composed of 81 places in 527 ms
[2020-06-03 05:51:55] [INFO ] Deduced a trap composed of 44 places in 525 ms
[2020-06-03 05:51:56] [INFO ] Deduced a trap composed of 47 places in 460 ms
[2020-06-03 05:51:57] [INFO ] Deduced a trap composed of 81 places in 519 ms
[2020-06-03 05:51:57] [INFO ] Deduced a trap composed of 86 places in 457 ms
[2020-06-03 05:51:58] [INFO ] Deduced a trap composed of 81 places in 510 ms
[2020-06-03 05:51:58] [INFO ] Deduced a trap composed of 20 places in 466 ms
[2020-06-03 05:51:59] [INFO ] Deduced a trap composed of 77 places in 470 ms
[2020-06-03 05:51:59] [INFO ] Deduced a trap composed of 77 places in 481 ms
[2020-06-03 05:52:00] [INFO ] Deduced a trap composed of 90 places in 478 ms
[2020-06-03 05:52:01] [INFO ] Deduced a trap composed of 68 places in 469 ms
[2020-06-03 05:52:01] [INFO ] Deduced a trap composed of 44 places in 587 ms
[2020-06-03 05:52:02] [INFO ] Deduced a trap composed of 83 places in 544 ms
[2020-06-03 05:52:02] [INFO ] Deduced a trap composed of 69 places in 445 ms
[2020-06-03 05:52:03] [INFO ] Deduced a trap composed of 62 places in 465 ms
[2020-06-03 05:52:04] [INFO ] Deduced a trap composed of 62 places in 707 ms
[2020-06-03 05:52:05] [INFO ] Deduced a trap composed of 38 places in 624 ms
[2020-06-03 05:52:05] [INFO ] Deduced a trap composed of 139 places in 607 ms
[2020-06-03 05:52:06] [INFO ] Deduced a trap composed of 29 places in 572 ms
[2020-06-03 05:52:07] [INFO ] Deduced a trap composed of 70 places in 519 ms
[2020-06-03 05:52:07] [INFO ] Deduced a trap composed of 163 places in 542 ms
[2020-06-03 05:52:08] [INFO ] Deduced a trap composed of 43 places in 655 ms
[2020-06-03 05:52:09] [INFO ] Deduced a trap composed of 17 places in 655 ms
[2020-06-03 05:52:09] [INFO ] Deduced a trap composed of 107 places in 533 ms
[2020-06-03 05:52:10] [INFO ] Deduced a trap composed of 28 places in 438 ms
[2020-06-03 05:52:11] [INFO ] Deduced a trap composed of 119 places in 514 ms
[2020-06-03 05:52:11] [INFO ] Deduced a trap composed of 113 places in 474 ms
[2020-06-03 05:52:12] [INFO ] Deduced a trap composed of 120 places in 403 ms
[2020-06-03 05:52:12] [INFO ] Deduced a trap composed of 119 places in 428 ms
[2020-06-03 05:52:13] [INFO ] Deduced a trap composed of 119 places in 411 ms
[2020-06-03 05:52:13] [INFO ] Deduced a trap composed of 26 places in 392 ms
[2020-06-03 05:52:14] [INFO ] Deduced a trap composed of 38 places in 373 ms
[2020-06-03 05:52:14] [INFO ] Deduced a trap composed of 155 places in 544 ms
[2020-06-03 05:52:15] [INFO ] Deduced a trap composed of 38 places in 454 ms
[2020-06-03 05:52:15] [INFO ] Deduced a trap composed of 26 places in 373 ms
[2020-06-03 05:52:16] [INFO ] Deduced a trap composed of 25 places in 304 ms
[2020-06-03 05:52:16] [INFO ] Deduced a trap composed of 68 places in 380 ms
[2020-06-03 05:52:17] [INFO ] Deduced a trap composed of 20 places in 504 ms
[2020-06-03 05:52:18] [INFO ] Deduced a trap composed of 36 places in 473 ms
[2020-06-03 05:52:18] [INFO ] Deduced a trap composed of 19 places in 404 ms
[2020-06-03 05:52:19] [INFO ] Deduced a trap composed of 212 places in 671 ms
[2020-06-03 05:52:19] [INFO ] Deduced a trap composed of 62 places in 555 ms
[2020-06-03 05:52:20] [INFO ] Deduced a trap composed of 59 places in 669 ms
[2020-06-03 05:52:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s7 s21 s22 s23 s77 s78 s79 s80 s81 s82 s105 s106 s143 s147 s148 s217 s225 s226 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283 s284 s285 s286 s287 s532 s533 s534 s535 s536 s537 s538 s539 s540 s541 s542 s543 s760 s784 s785 s786 s787 s788 s789 s790 s791 s792 s793 s794 s795 s796 s797) 0)") while checking expression at index 0
Support contains 476 out of 1078 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1078/1078 places, 1778/1778 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 1078 transition count 1742
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 1042 transition count 1742
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 216 Pre rules applied. Total rules applied 72 place count 1042 transition count 1526
Deduced a syphon composed of 216 places in 16 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 2 with 432 rules applied. Total rules applied 504 place count 826 transition count 1526
Applied a total of 504 rules in 211 ms. Remains 826 /1078 variables (removed 252) and now considering 1526/1778 (removed 252) transitions.
Finished structural reductions, in 1 iterations. Remains : 826/1078 places, 1526/1778 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3539 ms. (steps per millisecond=282 ) properties seen :[0]
Interrupted Best-First random walk after 124416 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=24 ) properties seen :[0]
Interrupted probabilistic random walk after 7125816 steps, run timeout after 30001 ms. (steps per millisecond=237 ) properties seen :[0]
Probabilistic random walk after 7125816 steps, saw 890728 distinct states, run finished after 30001 ms. (steps per millisecond=237 ) properties seen :[0]
[2020-06-03 05:52:59] [INFO ] Flow matrix only has 1316 transitions (discarded 210 similar events)
// Phase 1: matrix 1316 rows 826 cols
[2020-06-03 05:52:59] [INFO ] Computed 27 place invariants in 29 ms
[2020-06-03 05:52:59] [INFO ] [Real]Absence check using 20 positive place invariants in 138 ms returned sat
[2020-06-03 05:52:59] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 25 ms returned sat
[2020-06-03 05:52:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:53:03] [INFO ] [Real]Absence check using state equation in 3900 ms returned sat
[2020-06-03 05:53:03] [INFO ] State equation strengthened by 366 read => feed constraints.
[2020-06-03 05:53:03] [INFO ] [Real]Added 366 Read/Feed constraints in 104 ms returned sat
[2020-06-03 05:53:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:53:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 90 ms returned sat
[2020-06-03 05:53:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 23 ms returned sat
[2020-06-03 05:53:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:53:08] [INFO ] [Nat]Absence check using state equation in 3778 ms returned sat
[2020-06-03 05:53:08] [INFO ] [Nat]Added 366 Read/Feed constraints in 148 ms returned sat
[2020-06-03 05:53:08] [INFO ] Deduced a trap composed of 19 places in 552 ms
[2020-06-03 05:53:09] [INFO ] Deduced a trap composed of 17 places in 722 ms
[2020-06-03 05:53:10] [INFO ] Deduced a trap composed of 38 places in 463 ms
[2020-06-03 05:53:10] [INFO ] Deduced a trap composed of 34 places in 458 ms
[2020-06-03 05:53:11] [INFO ] Deduced a trap composed of 17 places in 782 ms
[2020-06-03 05:53:12] [INFO ] Deduced a trap composed of 19 places in 527 ms
[2020-06-03 05:53:12] [INFO ] Deduced a trap composed of 51 places in 479 ms
[2020-06-03 05:53:13] [INFO ] Deduced a trap composed of 47 places in 470 ms
[2020-06-03 05:53:13] [INFO ] Deduced a trap composed of 50 places in 490 ms
[2020-06-03 05:53:14] [INFO ] Deduced a trap composed of 74 places in 474 ms
[2020-06-03 05:53:14] [INFO ] Deduced a trap composed of 59 places in 426 ms
[2020-06-03 05:53:15] [INFO ] Deduced a trap composed of 17 places in 568 ms
[2020-06-03 05:53:16] [INFO ] Deduced a trap composed of 55 places in 501 ms
[2020-06-03 05:53:16] [INFO ] Deduced a trap composed of 69 places in 353 ms
[2020-06-03 05:53:17] [INFO ] Deduced a trap composed of 47 places in 426 ms
[2020-06-03 05:53:17] [INFO ] Deduced a trap composed of 47 places in 446 ms
[2020-06-03 05:53:18] [INFO ] Deduced a trap composed of 41 places in 856 ms
[2020-06-03 05:53:19] [INFO ] Deduced a trap composed of 35 places in 425 ms
[2020-06-03 05:53:19] [INFO ] Deduced a trap composed of 31 places in 472 ms
[2020-06-03 05:53:20] [INFO ] Deduced a trap composed of 13 places in 520 ms
[2020-06-03 05:53:20] [INFO ] Deduced a trap composed of 11 places in 455 ms
[2020-06-03 05:53:21] [INFO ] Deduced a trap composed of 52 places in 369 ms
[2020-06-03 05:53:21] [INFO ] Deduced a trap composed of 59 places in 396 ms
[2020-06-03 05:53:21] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 13584 ms
[2020-06-03 05:53:21] [INFO ] Computed and/alt/rep : 1519/8372/1309 causal constraints in 122 ms.
[2020-06-03 05:53:41] [INFO ] Added : 625 causal constraints over 125 iterations in 20160 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 122 ms.
Finished Parikh walk after 16732 steps, including 151 resets, run visited all 1 properties in 133 ms. (steps per millisecond=125 )
FORMULA Peterson-COL-6-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

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

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="Peterson-COL-6"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is Peterson-COL-6, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853600695"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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