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.r111-csrt-158961258000679.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 itstools
Input is Peterson-COL-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258000679
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 44K 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-4-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590019168931

[2020-05-20 23:59:32] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-20 23:59:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-20 23:59:33] [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-05-20 23:59:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 914 ms
[2020-05-20 23:59:33] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-05-20 23:59:34] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 185 ms.
[2020-05-20 23:59:34] [INFO ] Computed order based on color domains.
[2020-05-20 23:59:34] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions in 88 ms.
[2020-05-20 23:59:34] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 15 ms
Reduce places removed 20 places and 40 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 191 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 690 ms. (steps per millisecond=14 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0]
FORMULA Peterson-COL-4-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 243 ms. (steps per millisecond=41 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA Peterson-COL-4-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 265 ms. (steps per millisecond=37 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 135 ms. (steps per millisecond=74 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 159 ms. (steps per millisecond=62 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 164 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-20 23:59:36] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2020-05-20 23:59:36] [INFO ] Computed 19 place invariants in 75 ms
[2020-05-20 23:59:37] [INFO ] [Real]Absence check using 14 positive place invariants in 96 ms returned sat
[2020-05-20 23:59:37] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 34 ms returned sat
[2020-05-20 23:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:40] [INFO ] [Real]Absence check using state equation in 3061 ms returned sat
[2020-05-20 23:59:40] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-20 23:59:40] [INFO ] [Real]Added 132 Read/Feed constraints in 108 ms returned sat
[2020-05-20 23:59:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 83 ms returned sat
[2020-05-20 23:59:41] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 28 ms returned sat
[2020-05-20 23:59:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:43] [INFO ] [Nat]Absence check using state equation in 2582 ms returned sat
[2020-05-20 23:59:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 61 ms returned sat
[2020-05-20 23:59:47] [INFO ] Deduced a trap composed of 10 places in 3403 ms
[2020-05-20 23:59:47] [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 (> (+ s5 s15 s35 s36 s38 s39 s63 s115 s240 s332) 0)") while checking expression at index 0
[2020-05-20 23:59:47] [INFO ] [Real]Absence check using 14 positive place invariants in 135 ms returned sat
[2020-05-20 23:59:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 30 ms returned sat
[2020-05-20 23:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:51] [INFO ] [Real]Absence check using state equation in 3461 ms returned sat
[2020-05-20 23:59:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 41 ms returned sat
[2020-05-20 23:59:51] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 22 ms returned sat
[2020-05-20 23:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:54] [INFO ] [Nat]Absence check using state equation in 3255 ms returned sat
[2020-05-20 23:59:54] [INFO ] [Nat]Added 132 Read/Feed constraints in 103 ms returned sat
[2020-05-20 23:59:55] [INFO ] Deduced a trap composed of 98 places in 643 ms
[2020-05-20 23:59:56] [INFO ] Deduced a trap composed of 45 places in 1063 ms
[2020-05-20 23:59:56] [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 (> (+ s11 s24 s27 s28 s41 s42 s43 s44 s56 s67 s80 s81 s82 s83 s135 s136 s137 s138 s139 s183 s187 s205 s206 s207 s208 s260 s261 s262 s263 s264 s304 s305 s306 s348 s349 s350 s351 s385 s386 s387 s440 s441 s442 s443 s444) 0)") while checking expression at index 1
[2020-05-20 23:59:56] [INFO ] [Real]Absence check using 14 positive place invariants in 30 ms returned sat
[2020-05-20 23:59:56] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 10 ms returned sat
[2020-05-20 23:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-20 23:59:59] [INFO ] [Real]Absence check using state equation in 2642 ms returned sat
[2020-05-20 23:59:59] [INFO ] [Real]Added 132 Read/Feed constraints in 20 ms returned sat
[2020-05-20 23:59:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-20 23:59:59] [INFO ] [Nat]Absence check using 14 positive place invariants in 68 ms returned sat
[2020-05-20 23:59:59] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 17 ms returned sat
[2020-05-20 23:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:03] [INFO ] [Nat]Absence check using state equation in 3374 ms returned sat
[2020-05-21 00:00:03] [INFO ] [Nat]Added 132 Read/Feed constraints in 83 ms returned sat
[2020-05-21 00:00:04] [INFO ] Deduced a trap composed of 62 places in 1251 ms
[2020-05-21 00:00:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 00:00:05] [INFO ] Deduced a trap composed of 2 places in 1413 ms
[2020-05-21 00:00:05] [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 (> (+ s1 s8) 0)") while checking expression at index 2
[2020-05-21 00:00:06] [INFO ] [Real]Absence check using 14 positive place invariants in 48 ms returned sat
[2020-05-21 00:00:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2020-05-21 00:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:08] [INFO ] [Real]Absence check using state equation in 1907 ms returned sat
[2020-05-21 00:00:08] [INFO ] [Real]Added 132 Read/Feed constraints in 78 ms returned sat
[2020-05-21 00:00:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:00:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 140 ms returned sat
[2020-05-21 00:00:08] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 18 ms returned sat
[2020-05-21 00:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:11] [INFO ] [Nat]Absence check using state equation in 2832 ms returned sat
[2020-05-21 00:00:11] [INFO ] [Nat]Added 132 Read/Feed constraints in 105 ms returned sat
[2020-05-21 00:00:13] [INFO ] Deduced a trap composed of 49 places in 1732 ms
[2020-05-21 00:00:16] [INFO ] Deduced a trap composed of 18 places in 2920 ms
[2020-05-21 00:00:16] [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 (> (+ s9 s23 s35 s36 s37 s39 s67 s135 s136 s137 s260 s261 s262 s348 s349 s350 s440 s441) 0)") while checking expression at index 3
[2020-05-21 00:00:16] [INFO ] [Real]Absence check using 14 positive place invariants in 67 ms returned sat
[2020-05-21 00:00:16] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 39 ms returned sat
[2020-05-21 00:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:18] [INFO ] [Real]Absence check using state equation in 2175 ms returned sat
[2020-05-21 00:00:18] [INFO ] [Real]Added 132 Read/Feed constraints in 47 ms returned sat
[2020-05-21 00:00:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:00:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 63 ms returned sat
[2020-05-21 00:00:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 30 ms returned sat
[2020-05-21 00:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:22] [INFO ] [Nat]Absence check using state equation in 3289 ms returned sat
[2020-05-21 00:00:22] [INFO ] [Nat]Added 132 Read/Feed constraints in 45 ms returned sat
[2020-05-21 00:00:24] [INFO ] Deduced a trap composed of 54 places in 1856 ms
[2020-05-21 00:00:24] [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 (> (+ s5 s15 s16 s17 s45 s46 s47 s49 s55 s56 s69 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s145 s175 s176 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s270 s300 s301 s302 s303 s304 s305 s306 s307 s356 s380 s381 s382 s383 s384 s385 s386 s387 s388 s389) 0)") while checking expression at index 4
[2020-05-21 00:00:24] [INFO ] [Real]Absence check using 14 positive place invariants in 59 ms returned sat
[2020-05-21 00:00:24] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 30 ms returned sat
[2020-05-21 00:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:27] [INFO ] [Real]Absence check using state equation in 3041 ms returned sat
[2020-05-21 00:00:27] [INFO ] [Real]Added 132 Read/Feed constraints in 86 ms returned sat
[2020-05-21 00:00:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:00:27] [INFO ] [Nat]Absence check using 14 positive place invariants in 56 ms returned sat
[2020-05-21 00:00:27] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 14 ms returned sat
[2020-05-21 00:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:31] [INFO ] [Nat]Absence check using state equation in 3672 ms returned sat
[2020-05-21 00:00:31] [INFO ] [Nat]Added 132 Read/Feed constraints in 91 ms returned sat
[2020-05-21 00:00:34] [INFO ] Deduced a trap composed of 25 places in 3184 ms
[2020-05-21 00:00:34] [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 (> (+ s13 s31 s35 s36 s38 s39 s63 s115 s116 s117 s118 s119 s240 s241 s242 s243 s244 s332 s333 s334 s335 s420 s421 s422 s423) 0)") while checking expression at index 5
[2020-05-21 00:00:34] [INFO ] [Real]Absence check using 14 positive place invariants in 53 ms returned unsat
[2020-05-21 00:00:35] [INFO ] [Real]Absence check using 14 positive place invariants in 114 ms returned sat
[2020-05-21 00:00:35] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 31 ms returned sat
[2020-05-21 00:00:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:38] [INFO ] [Real]Absence check using state equation in 3817 ms returned sat
[2020-05-21 00:00:39] [INFO ] [Real]Added 132 Read/Feed constraints in 79 ms returned sat
[2020-05-21 00:00:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:00:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 53 ms returned sat
[2020-05-21 00:00:39] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned sat
[2020-05-21 00:00:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:00:42] [INFO ] [Nat]Absence check using state equation in 2738 ms returned sat
[2020-05-21 00:00:42] [INFO ] [Nat]Added 132 Read/Feed constraints in 62 ms returned sat
[2020-05-21 00:00:45] [INFO ] Deduced a trap composed of 27 places in 3571 ms
[2020-05-21 00:00:45] [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 (> (+ s5 s7 s15 s16 s19 s20 s40 s41 s42 s44 s55 s59 s68 s75 s76 s95 s140 s175 s179 s200 s201 s220 s265 s300 s316 s352 s380) 0)") while checking expression at index 7
FORMULA Peterson-COL-4-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 460 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 70 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 480/480 places, 690/690 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 8297 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 665910 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 343284 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1917 ms. (steps per millisecond=521 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3136 ms. (steps per millisecond=318 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 781014 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 298110 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=59 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 766128 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 10457928 steps, run timeout after 30001 ms. (steps per millisecond=348 ) properties seen :[1, 1, 1, 0, 0, 1, 0]
Probabilistic random walk after 10457928 steps, saw 1742989 distinct states, run finished after 30003 ms. (steps per millisecond=348 ) properties seen :[1, 1, 1, 0, 0, 1, 0]
FORMULA Peterson-COL-4-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2020-05-21 00:01:54] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2020-05-21 00:01:54] [INFO ] Computed 19 place invariants in 14 ms
[2020-05-21 00:01:54] [INFO ] [Real]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-05-21 00:01:54] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 10 ms returned sat
[2020-05-21 00:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:01:55] [INFO ] [Real]Absence check using state equation in 959 ms returned sat
[2020-05-21 00:01:55] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-21 00:01:55] [INFO ] [Real]Added 132 Read/Feed constraints in 114 ms returned sat
[2020-05-21 00:01:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:01:55] [INFO ] [Nat]Absence check using 14 positive place invariants in 41 ms returned sat
[2020-05-21 00:01:55] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 11 ms returned sat
[2020-05-21 00:01:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:01:56] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2020-05-21 00:01:56] [INFO ] [Nat]Added 132 Read/Feed constraints in 85 ms returned sat
[2020-05-21 00:01:58] [INFO ] Deduced a trap composed of 49 places in 1826 ms
[2020-05-21 00:01:59] [INFO ] Deduced a trap composed of 18 places in 327 ms
[2020-05-21 00:01:59] [INFO ] Deduced a trap composed of 54 places in 300 ms
[2020-05-21 00:02:00] [INFO ] Deduced a trap composed of 18 places in 668 ms
[2020-05-21 00:02:00] [INFO ] Deduced a trap composed of 99 places in 463 ms
[2020-05-21 00:02:01] [INFO ] Deduced a trap composed of 98 places in 416 ms
[2020-05-21 00:02:01] [INFO ] Deduced a trap composed of 39 places in 288 ms
[2020-05-21 00:02:01] [INFO ] Deduced a trap composed of 79 places in 233 ms
[2020-05-21 00:02:03] [INFO ] Deduced a trap composed of 47 places in 1554 ms
[2020-05-21 00:02:04] [INFO ] Deduced a trap composed of 54 places in 795 ms
[2020-05-21 00:02:04] [INFO ] Deduced a trap composed of 32 places in 671 ms
[2020-05-21 00:02:05] [INFO ] Deduced a trap composed of 59 places in 224 ms
[2020-05-21 00:02:05] [INFO ] Deduced a trap composed of 65 places in 222 ms
[2020-05-21 00:02:07] [INFO ] Deduced a trap composed of 40 places in 1697 ms
[2020-05-21 00:02:08] [INFO ] Deduced a trap composed of 103 places in 730 ms
[2020-05-21 00:02:09] [INFO ] Deduced a trap composed of 94 places in 1045 ms
[2020-05-21 00:02:09] [INFO ] Deduced a trap composed of 18 places in 622 ms
[2020-05-21 00:02:10] [INFO ] Deduced a trap composed of 61 places in 374 ms
[2020-05-21 00:02:11] [INFO ] Deduced a trap composed of 10 places in 1398 ms
[2020-05-21 00:02:13] [INFO ] Deduced a trap composed of 19 places in 1611 ms
[2020-05-21 00:02:14] [INFO ] Deduced a trap composed of 17 places in 828 ms
[2020-05-21 00:02:14] [INFO ] Deduced a trap composed of 10 places in 480 ms
[2020-05-21 00:02:15] [INFO ] Deduced a trap composed of 15 places in 365 ms
[2020-05-21 00:02:16] [INFO ] Deduced a trap composed of 18 places in 867 ms
[2020-05-21 00:02:18] [INFO ] Deduced a trap composed of 38 places in 2051 ms
[2020-05-21 00:02:19] [INFO ] Deduced a trap composed of 15 places in 782 ms
[2020-05-21 00:02:19] [INFO ] Deduced a trap composed of 14 places in 456 ms
[2020-05-21 00:02:22] [INFO ] Deduced a trap composed of 60 places in 2461 ms
[2020-05-21 00:02:23] [INFO ] Deduced a trap composed of 60 places in 1278 ms
[2020-05-21 00:02:23] [INFO ] Deduced a trap composed of 76 places in 221 ms
[2020-05-21 00:02:24] [INFO ] Deduced a trap composed of 32 places in 481 ms
[2020-05-21 00:02:24] [INFO ] Deduced a trap composed of 54 places in 598 ms
[2020-05-21 00:02:25] [INFO ] Deduced a trap composed of 30 places in 404 ms
[2020-05-21 00:02:26] [INFO ] Deduced a trap composed of 47 places in 1275 ms
[2020-05-21 00:02:27] [INFO ] Deduced a trap composed of 32 places in 930 ms
[2020-05-21 00:02:28] [INFO ] Deduced a trap composed of 72 places in 328 ms
[2020-05-21 00:02:28] [INFO ] Deduced a trap composed of 76 places in 311 ms
[2020-05-21 00:02:29] [INFO ] Deduced a trap composed of 32 places in 513 ms
[2020-05-21 00:02:29] [INFO ] Deduced a trap composed of 76 places in 804 ms
[2020-05-21 00:02:30] [INFO ] Deduced a trap composed of 62 places in 678 ms
[2020-05-21 00:02:31] [INFO ] Deduced a trap composed of 38 places in 602 ms
[2020-05-21 00:02:32] [INFO ] Deduced a trap composed of 40 places in 665 ms
[2020-05-21 00:02:33] [INFO ] Deduced a trap composed of 78 places in 1445 ms
[2020-05-21 00:02:36] [INFO ] Deduced a trap composed of 62 places in 2192 ms
[2020-05-21 00:02:36] [INFO ] Deduced a trap composed of 36 places in 752 ms
[2020-05-21 00:02:38] [INFO ] Deduced a trap composed of 36 places in 1205 ms
[2020-05-21 00:02:39] [INFO ] Deduced a trap composed of 80 places in 856 ms
[2020-05-21 00:02:39] [INFO ] Deduced a trap composed of 88 places in 386 ms
[2020-05-21 00:02:39] [INFO ] Deduced a trap composed of 27 places in 273 ms
[2020-05-21 00:02:40] [INFO ] Deduced a trap composed of 88 places in 264 ms
[2020-05-21 00:02:40] [INFO ] Deduced a trap composed of 36 places in 405 ms
[2020-05-21 00:02:40] [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 s19 s20 s40 s41 s42 s44 s59 s68 s95 s96 s97 s98 s99 s140 s141 s179 s220 s221 s222 s223 s224 s265 s266 s316 s317 s318 s319 s352 s353 s400 s401 s402 s403 s404 s445) 0)") while checking expression at index 0
[2020-05-21 00:02:40] [INFO ] [Real]Absence check using 14 positive place invariants in 28 ms returned sat
[2020-05-21 00:02:40] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2020-05-21 00:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:02:42] [INFO ] [Real]Absence check using state equation in 1897 ms returned sat
[2020-05-21 00:02:42] [INFO ] [Real]Added 132 Read/Feed constraints in 27 ms returned sat
[2020-05-21 00:02:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:02:43] [INFO ] [Nat]Absence check using 14 positive place invariants in 204 ms returned sat
[2020-05-21 00:02:43] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 61 ms returned sat
[2020-05-21 00:02:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:02:44] [INFO ] [Nat]Absence check using state equation in 1754 ms returned sat
[2020-05-21 00:02:45] [INFO ] [Nat]Added 132 Read/Feed constraints in 68 ms returned sat
[2020-05-21 00:02:46] [INFO ] Deduced a trap composed of 54 places in 1932 ms
[2020-05-21 00:02:48] [INFO ] Deduced a trap composed of 10 places in 1833 ms
[2020-05-21 00:02:50] [INFO ] Deduced a trap composed of 18 places in 1243 ms
[2020-05-21 00:02:51] [INFO ] Deduced a trap composed of 32 places in 775 ms
[2020-05-21 00:02:51] [INFO ] Deduced a trap composed of 10 places in 322 ms
[2020-05-21 00:02:52] [INFO ] Deduced a trap composed of 10 places in 1289 ms
[2020-05-21 00:02:53] [INFO ] Deduced a trap composed of 21 places in 525 ms
[2020-05-21 00:02:53] [INFO ] Deduced a trap composed of 21 places in 384 ms
[2020-05-21 00:02:54] [INFO ] Deduced a trap composed of 54 places in 888 ms
[2020-05-21 00:02:56] [INFO ] Deduced a trap composed of 76 places in 1230 ms
[2020-05-21 00:02:56] [INFO ] Deduced a trap composed of 76 places in 626 ms
[2020-05-21 00:02:59] [INFO ] Deduced a trap composed of 80 places in 2527 ms
[2020-05-21 00:02:59] [INFO ] Deduced a trap composed of 69 places in 360 ms
[2020-05-21 00:03:00] [INFO ] Deduced a trap composed of 54 places in 312 ms
[2020-05-21 00:03:00] [INFO ] Deduced a trap composed of 43 places in 816 ms
[2020-05-21 00:03:01] [INFO ] Deduced a trap composed of 76 places in 449 ms
[2020-05-21 00:03:01] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 16471 ms
[2020-05-21 00:03:01] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 100 ms.
[2020-05-21 00:03:12] [INFO ] Added : 622 causal constraints over 125 iterations in 11424 ms. Result :sat
[2020-05-21 00:03:13] [INFO ] Deduced a trap composed of 33 places in 782 ms
[2020-05-21 00:03:14] [INFO ] Deduced a trap composed of 79 places in 266 ms
[2020-05-21 00:03:14] [INFO ] Deduced a trap composed of 54 places in 161 ms
[2020-05-21 00:03:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1702 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
[2020-05-21 00:03:14] [INFO ] [Real]Absence check using 14 positive place invariants in 48 ms returned sat
[2020-05-21 00:03:14] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 18 ms returned sat
[2020-05-21 00:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:03:18] [INFO ] [Real]Absence check using state equation in 3154 ms returned sat
[2020-05-21 00:03:18] [INFO ] [Real]Added 132 Read/Feed constraints in 55 ms returned sat
[2020-05-21 00:03:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:03:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 44 ms returned sat
[2020-05-21 00:03:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 15 ms returned sat
[2020-05-21 00:03:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:03:19] [INFO ] [Nat]Absence check using state equation in 1388 ms returned sat
[2020-05-21 00:03:19] [INFO ] [Nat]Added 132 Read/Feed constraints in 85 ms returned sat
[2020-05-21 00:03:20] [INFO ] Deduced a trap composed of 27 places in 572 ms
[2020-05-21 00:03:21] [INFO ] Deduced a trap composed of 10 places in 1097 ms
[2020-05-21 00:03:23] [INFO ] Deduced a trap composed of 95 places in 1704 ms
[2020-05-21 00:03:23] [INFO ] Deduced a trap composed of 14 places in 338 ms
[2020-05-21 00:03:25] [INFO ] Deduced a trap composed of 18 places in 1448 ms
[2020-05-21 00:03:25] [INFO ] Deduced a trap composed of 54 places in 447 ms
[2020-05-21 00:03:27] [INFO ] Deduced a trap composed of 22 places in 1808 ms
[2020-05-21 00:03:29] [INFO ] Deduced a trap composed of 64 places in 1787 ms
[2020-05-21 00:03:30] [INFO ] Deduced a trap composed of 25 places in 868 ms
[2020-05-21 00:03:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 10564 ms
[2020-05-21 00:03:30] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 30 ms.
[2020-05-21 00:03:37] [INFO ] Added : 458 causal constraints over 92 iterations in 7372 ms. Result :sat
[2020-05-21 00:03:39] [INFO ] Deduced a trap composed of 98 places in 1920 ms
[2020-05-21 00:03:40] [INFO ] Deduced a trap composed of 101 places in 931 ms
[2020-05-21 00:03:41] [INFO ] Deduced a trap composed of 98 places in 572 ms
[2020-05-21 00:03:43] [INFO ] Deduced a trap composed of 56 places in 1985 ms
[2020-05-21 00:03:44] [INFO ] Deduced a trap composed of 82 places in 937 ms
[2020-05-21 00:03:45] [INFO ] Deduced a trap composed of 82 places in 472 ms
[2020-05-21 00:03:45] [INFO ] Deduced a trap composed of 70 places in 292 ms
[2020-05-21 00:03:47] [INFO ] Deduced a trap composed of 32 places in 1154 ms
[2020-05-21 00:03:47] [INFO ] Deduced a trap composed of 39 places in 685 ms
[2020-05-21 00:03:50] [INFO ] Deduced a trap composed of 45 places in 2720 ms
[2020-05-21 00:03:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 13032 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
Incomplete Parikh walk after 103200 steps, including 1000 resets, run finished after 329 ms. (steps per millisecond=313 ) properties seen :[0, 1, 1] could not realise parikh vector
FORMULA Peterson-COL-4-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 170400 steps, including 1000 resets, run finished after 338 ms. (steps per millisecond=504 ) properties seen :[0] could not realise parikh vector
Support contains 35 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Iterating post reduction 0 with 192 rules applied. Total rules applied 192 place count 480 transition count 498
Reduce places removed 192 places and 0 transitions.
Iterating post reduction 1 with 192 rules applied. Total rules applied 384 place count 288 transition count 498
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 384 place count 288 transition count 399
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 582 place count 189 transition count 399
Applied a total of 582 rules in 89 ms. Remains 189 /480 variables (removed 291) and now considering 399/690 (removed 291) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/480 places, 399/690 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1336 ms. (steps per millisecond=748 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1235 ms. (steps per millisecond=809 ) properties seen :[0]
Interrupted probabilistic random walk after 14131032 steps, run timeout after 30001 ms. (steps per millisecond=471 ) properties seen :[0]
Probabilistic random walk after 14131032 steps, saw 2355173 distinct states, run finished after 30003 ms. (steps per millisecond=470 ) properties seen :[0]
[2020-05-21 00:04:24] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-05-21 00:04:24] [INFO ] Computed 19 place invariants in 1 ms
[2020-05-21 00:04:24] [INFO ] [Real]Absence check using 14 positive place invariants in 38 ms returned sat
[2020-05-21 00:04:24] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 8 ms returned sat
[2020-05-21 00:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:04:24] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2020-05-21 00:04:24] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-21 00:04:24] [INFO ] [Real]Added 132 Read/Feed constraints in 43 ms returned sat
[2020-05-21 00:04:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:04:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 67 ms returned sat
[2020-05-21 00:04:25] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 26 ms returned sat
[2020-05-21 00:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:04:25] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2020-05-21 00:04:25] [INFO ] [Nat]Added 132 Read/Feed constraints in 48 ms returned sat
[2020-05-21 00:04:26] [INFO ] Deduced a trap composed of 10 places in 582 ms
[2020-05-21 00:04:27] [INFO ] Deduced a trap composed of 10 places in 634 ms
[2020-05-21 00:04:28] [INFO ] Deduced a trap composed of 21 places in 1176 ms
[2020-05-21 00:04:29] [INFO ] Deduced a trap composed of 24 places in 1030 ms
[2020-05-21 00:04:29] [INFO ] Deduced a trap composed of 8 places in 241 ms
[2020-05-21 00:04:30] [INFO ] Deduced a trap composed of 9 places in 1095 ms
[2020-05-21 00:04:30] [INFO ] Deduced a trap composed of 11 places in 110 ms
[2020-05-21 00:04:31] [INFO ] Deduced a trap composed of 17 places in 74 ms
[2020-05-21 00:04:31] [INFO ] Deduced a trap composed of 15 places in 404 ms
[2020-05-21 00:04:31] [INFO ] Deduced a trap composed of 22 places in 108 ms
[2020-05-21 00:04:31] [INFO ] Deduced a trap composed of 27 places in 191 ms
[2020-05-21 00:04:32] [INFO ] Deduced a trap composed of 22 places in 509 ms
[2020-05-21 00:04:32] [INFO ] Deduced a trap composed of 15 places in 128 ms
[2020-05-21 00:04:32] [INFO ] Deduced a trap composed of 16 places in 211 ms
[2020-05-21 00:04:33] [INFO ] Deduced a trap composed of 15 places in 352 ms
[2020-05-21 00:04:33] [INFO ] Deduced a trap composed of 22 places in 228 ms
[2020-05-21 00:04:33] [INFO ] Deduced a trap composed of 24 places in 361 ms
[2020-05-21 00:04:34] [INFO ] Deduced a trap composed of 24 places in 642 ms
[2020-05-21 00:04:35] [INFO ] Deduced a trap composed of 29 places in 847 ms
[2020-05-21 00:04:35] [INFO ] Deduced a trap composed of 16 places in 86 ms
[2020-05-21 00:04:35] [INFO ] Deduced a trap composed of 24 places in 73 ms
[2020-05-21 00:04:35] [INFO ] Deduced a trap composed of 35 places in 269 ms
[2020-05-21 00:04:35] [INFO ] Deduced a trap composed of 35 places in 116 ms
[2020-05-21 00:04:36] [INFO ] Deduced a trap composed of 22 places in 174 ms
[2020-05-21 00:04:36] [INFO ] Deduced a trap composed of 52 places in 109 ms
[2020-05-21 00:04:36] [INFO ] Deduced a trap composed of 52 places in 163 ms
[2020-05-21 00:04:36] [INFO ] Deduced a trap composed of 23 places in 68 ms
[2020-05-21 00:04:36] [INFO ] Deduced a trap composed of 21 places in 186 ms
[2020-05-21 00:04:37] [INFO ] Deduced a trap composed of 17 places in 462 ms
[2020-05-21 00:04:37] [INFO ] Deduced a trap composed of 26 places in 181 ms
[2020-05-21 00:04:38] [INFO ] Deduced a trap composed of 20 places in 717 ms
[2020-05-21 00:04:38] [INFO ] Deduced a trap composed of 18 places in 561 ms
[2020-05-21 00:04:39] [INFO ] Deduced a trap composed of 24 places in 136 ms
[2020-05-21 00:04:39] [INFO ] Deduced a trap composed of 11 places in 302 ms
[2020-05-21 00:04:39] [INFO ] Deduced a trap composed of 11 places in 280 ms
[2020-05-21 00:04:39] [INFO ] Deduced a trap composed of 19 places in 97 ms
[2020-05-21 00:04:40] [INFO ] Deduced a trap composed of 29 places in 111 ms
[2020-05-21 00:04:41] [INFO ] Deduced a trap composed of 29 places in 1206 ms
[2020-05-21 00:04:41] [INFO ] Deduced a trap composed of 28 places in 96 ms
[2020-05-21 00:04:41] [INFO ] Deduced a trap composed of 19 places in 224 ms
[2020-05-21 00:04:41] [INFO ] Deduced a trap composed of 22 places in 137 ms
[2020-05-21 00:04:42] [INFO ] Deduced a trap composed of 16 places in 193 ms
[2020-05-21 00:04:42] [INFO ] Deduced a trap composed of 10 places in 644 ms
[2020-05-21 00:04:43] [INFO ] Deduced a trap composed of 22 places in 388 ms
[2020-05-21 00:04:43] [INFO ] Deduced a trap composed of 29 places in 509 ms
[2020-05-21 00:04:43] [INFO ] Deduced a trap composed of 18 places in 87 ms
[2020-05-21 00:04:44] [INFO ] Deduced a trap composed of 25 places in 333 ms
[2020-05-21 00:04:44] [INFO ] Deduced a trap composed of 28 places in 90 ms
[2020-05-21 00:04:44] [INFO ] Deduced a trap composed of 50 places in 468 ms
[2020-05-21 00:04:45] [INFO ] Deduced a trap composed of 31 places in 114 ms
[2020-05-21 00:04:45] [INFO ] Deduced a trap composed of 40 places in 125 ms
[2020-05-21 00:04:46] [INFO ] Deduced a trap composed of 26 places in 707 ms
[2020-05-21 00:04:46] [INFO ] Deduced a trap composed of 43 places in 436 ms
[2020-05-21 00:04:47] [INFO ] Deduced a trap composed of 36 places in 518 ms
[2020-05-21 00:04:48] [INFO ] Deduced a trap composed of 62 places in 1006 ms
[2020-05-21 00:04:49] [INFO ] Deduced a trap composed of 16 places in 691 ms
[2020-05-21 00:04:49] [INFO ] Deduced a trap composed of 11 places in 78 ms
[2020-05-21 00:04:49] [INFO ] Deduced a trap composed of 35 places in 88 ms
[2020-05-21 00:04:50] [INFO ] Deduced a trap composed of 27 places in 691 ms
[2020-05-21 00:04:50] [INFO ] Deduced a trap composed of 27 places in 177 ms
[2020-05-21 00:04:50] [INFO ] Deduced a trap composed of 27 places in 161 ms
[2020-05-21 00:04:50] [INFO ] Deduced a trap composed of 51 places in 154 ms
[2020-05-21 00:04:50] [INFO ] Deduced a trap composed of 19 places in 114 ms
[2020-05-21 00:04:51] [INFO ] Deduced a trap composed of 26 places in 226 ms
[2020-05-21 00:04:51] [INFO ] Deduced a trap composed of 26 places in 393 ms
[2020-05-21 00:04:51] [INFO ] Deduced a trap composed of 34 places in 92 ms
[2020-05-21 00:04:52] [INFO ] Deduced a trap composed of 18 places in 452 ms
[2020-05-21 00:04:52] [INFO ] Deduced a trap composed of 11 places in 389 ms
[2020-05-21 00:04:53] [INFO ] Deduced a trap composed of 11 places in 453 ms
[2020-05-21 00:04:53] [INFO ] Deduced a trap composed of 42 places in 611 ms
[2020-05-21 00:04:53] [INFO ] Deduced a trap composed of 31 places in 86 ms
[2020-05-21 00:04:54] [INFO ] Deduced a trap composed of 44 places in 459 ms
[2020-05-21 00:04:54] [INFO ] Deduced a trap composed of 44 places in 230 ms
[2020-05-21 00:04:54] [INFO ] Deduced a trap composed of 40 places in 94 ms
[2020-05-21 00:04:55] [INFO ] Deduced a trap composed of 48 places in 1063 ms
[2020-05-21 00:04:56] [INFO ] Deduced a trap composed of 19 places in 160 ms
[2020-05-21 00:04:56] [INFO ] Deduced a trap composed of 22 places in 254 ms
[2020-05-21 00:04:56] [INFO ] Deduced a trap composed of 49 places in 246 ms
[2020-05-21 00:04:56] [INFO ] Deduced a trap composed of 37 places in 135 ms
[2020-05-21 00:04:56] [INFO ] Deduced a trap composed of 20 places in 96 ms
[2020-05-21 00:04:57] [INFO ] Deduced a trap composed of 17 places in 593 ms
[2020-05-21 00:04:57] [INFO ] Deduced a trap composed of 41 places in 235 ms
[2020-05-21 00:04:58] [INFO ] Deduced a trap composed of 32 places in 200 ms
[2020-05-21 00:04:58] [INFO ] Deduced a trap composed of 34 places in 298 ms
[2020-05-21 00:04:58] [INFO ] Deduced a trap composed of 17 places in 170 ms
[2020-05-21 00:04:59] [INFO ] Deduced a trap composed of 14 places in 191 ms
[2020-05-21 00:04:59] [INFO ] Deduced a trap composed of 41 places in 168 ms
[2020-05-21 00:04:59] [INFO ] Deduced a trap composed of 42 places in 176 ms
[2020-05-21 00:05:01] [INFO ] Deduced a trap composed of 8 places in 1798 ms
[2020-05-21 00:05:02] [INFO ] Deduced a trap composed of 35 places in 584 ms
[2020-05-21 00:05:02] [INFO ] Deduced a trap composed of 31 places in 120 ms
[2020-05-21 00:05:04] [INFO ] Deduced a trap composed of 35 places in 1387 ms
[2020-05-21 00:05:05] [INFO ] Deduced a trap composed of 44 places in 1053 ms
[2020-05-21 00:05:05] [INFO ] Deduced a trap composed of 34 places in 143 ms
[2020-05-21 00:05:05] [INFO ] Deduced a trap composed of 24 places in 193 ms
[2020-05-21 00:05:06] [INFO ] Deduced a trap composed of 16 places in 328 ms
[2020-05-21 00:05:06] [INFO ] Deduced a trap composed of 24 places in 581 ms
[2020-05-21 00:05:06] [INFO ] Deduced a trap composed of 38 places in 87 ms
[2020-05-21 00:05:07] [INFO ] Deduced a trap composed of 49 places in 569 ms
[2020-05-21 00:05:07] [INFO ] Deduced a trap composed of 41 places in 208 ms
[2020-05-21 00:05:07] [INFO ] Deduced a trap composed of 40 places in 77 ms
[2020-05-21 00:05:07] [INFO ] Deduced a trap composed of 40 places in 79 ms
[2020-05-21 00:05:08] [INFO ] Deduced a trap composed of 20 places in 135 ms
[2020-05-21 00:05:08] [INFO ] Deduced a trap composed of 19 places in 243 ms
[2020-05-21 00:05:08] [INFO ] Deduced a trap composed of 24 places in 223 ms
[2020-05-21 00:05:09] [INFO ] Deduced a trap composed of 17 places in 765 ms
[2020-05-21 00:05:09] [INFO ] Deduced a trap composed of 32 places in 181 ms
[2020-05-21 00:05:10] [INFO ] Deduced a trap composed of 35 places in 620 ms
[2020-05-21 00:05:10] [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 (> (+ s11 s18 s30 s31 s32 s34 s35 s36 s38 s39 s51 s52 s53 s54 s71 s72 s73 s74 s92 s93 s94 s149 s150 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164) 0)") while checking expression at index 0
Support contains 35 out of 189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 189/189 places, 399/399 transitions.
Applied a total of 0 rules in 18 ms. Remains 189 /189 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 399/399 transitions.
Starting structural reductions, iteration 0 : 189/189 places, 399/399 transitions.
Applied a total of 0 rules in 16 ms. Remains 189 /189 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2020-05-21 00:05:10] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-05-21 00:05:10] [INFO ] Computed 19 place invariants in 2 ms
[2020-05-21 00:05:12] [INFO ] Implicit Places using invariants in 2013 ms returned []
[2020-05-21 00:05:12] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-05-21 00:05:12] [INFO ] Computed 19 place invariants in 3 ms
[2020-05-21 00:05:13] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-21 00:05:15] [INFO ] Implicit Places using invariants and state equation in 3525 ms returned []
Implicit Place search using SMT with State Equation took 5543 ms to find 0 implicit places.
[2020-05-21 00:05:16] [INFO ] Redundant transitions in 30 ms returned []
[2020-05-21 00:05:16] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-05-21 00:05:16] [INFO ] Computed 19 place invariants in 1 ms
[2020-05-21 00:05:17] [INFO ] Dead Transitions using invariants and state equation in 1847 ms returned []
Finished structural reductions, in 1 iterations. Remains : 189/189 places, 399/399 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 139 ms. (steps per millisecond=719 ) properties seen :[0]
[2020-05-21 00:05:18] [INFO ] Flow matrix only has 339 transitions (discarded 60 similar events)
// Phase 1: matrix 339 rows 189 cols
[2020-05-21 00:05:18] [INFO ] Computed 19 place invariants in 2 ms
[2020-05-21 00:05:18] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2020-05-21 00:05:18] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 61 ms returned sat
[2020-05-21 00:05:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:05:18] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2020-05-21 00:05:18] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-21 00:05:18] [INFO ] [Real]Added 132 Read/Feed constraints in 29 ms returned sat
[2020-05-21 00:05:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:05:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-05-21 00:05:18] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 34 ms returned sat
[2020-05-21 00:05:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:05:19] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2020-05-21 00:05:19] [INFO ] [Nat]Added 132 Read/Feed constraints in 77 ms returned sat
[2020-05-21 00:05:19] [INFO ] Deduced a trap composed of 10 places in 451 ms
[2020-05-21 00:05:19] [INFO ] Deduced a trap composed of 10 places in 88 ms
[2020-05-21 00:05:20] [INFO ] Deduced a trap composed of 21 places in 972 ms
[2020-05-21 00:05:21] [INFO ] Deduced a trap composed of 24 places in 235 ms
[2020-05-21 00:05:21] [INFO ] Deduced a trap composed of 8 places in 223 ms
[2020-05-21 00:05:21] [INFO ] Deduced a trap composed of 9 places in 466 ms
[2020-05-21 00:05:22] [INFO ] Deduced a trap composed of 11 places in 259 ms
[2020-05-21 00:05:22] [INFO ] Deduced a trap composed of 17 places in 227 ms
[2020-05-21 00:05:22] [INFO ] Deduced a trap composed of 15 places in 166 ms
[2020-05-21 00:05:23] [INFO ] Deduced a trap composed of 22 places in 375 ms
[2020-05-21 00:05:23] [INFO ] Deduced a trap composed of 27 places in 503 ms
[2020-05-21 00:05:24] [INFO ] Deduced a trap composed of 22 places in 1052 ms
[2020-05-21 00:05:24] [INFO ] Deduced a trap composed of 15 places in 153 ms
[2020-05-21 00:05:25] [INFO ] Deduced a trap composed of 16 places in 524 ms
[2020-05-21 00:05:25] [INFO ] Deduced a trap composed of 15 places in 240 ms
[2020-05-21 00:05:25] [INFO ] Deduced a trap composed of 22 places in 133 ms
[2020-05-21 00:05:26] [INFO ] Deduced a trap composed of 24 places in 343 ms
[2020-05-21 00:05:26] [INFO ] Deduced a trap composed of 24 places in 85 ms
[2020-05-21 00:05:26] [INFO ] Deduced a trap composed of 29 places in 147 ms
[2020-05-21 00:05:27] [INFO ] Deduced a trap composed of 16 places in 576 ms
[2020-05-21 00:05:27] [INFO ] Deduced a trap composed of 24 places in 355 ms
[2020-05-21 00:05:28] [INFO ] Deduced a trap composed of 35 places in 469 ms
[2020-05-21 00:05:28] [INFO ] Deduced a trap composed of 35 places in 185 ms
[2020-05-21 00:05:28] [INFO ] Deduced a trap composed of 22 places in 114 ms
[2020-05-21 00:05:30] [INFO ] Deduced a trap composed of 52 places in 2072 ms
[2020-05-21 00:05:31] [INFO ] Deduced a trap composed of 52 places in 422 ms
[2020-05-21 00:05:31] [INFO ] Deduced a trap composed of 23 places in 103 ms
[2020-05-21 00:05:31] [INFO ] Deduced a trap composed of 21 places in 233 ms
[2020-05-21 00:05:31] [INFO ] Deduced a trap composed of 17 places in 177 ms
[2020-05-21 00:05:32] [INFO ] Deduced a trap composed of 26 places in 768 ms
[2020-05-21 00:05:34] [INFO ] Deduced a trap composed of 20 places in 1709 ms
[2020-05-21 00:05:34] [INFO ] Deduced a trap composed of 18 places in 200 ms
[2020-05-21 00:05:35] [INFO ] Deduced a trap composed of 24 places in 439 ms
[2020-05-21 00:05:35] [INFO ] Deduced a trap composed of 11 places in 202 ms
[2020-05-21 00:05:36] [INFO ] Deduced a trap composed of 11 places in 958 ms
[2020-05-21 00:05:36] [INFO ] Deduced a trap composed of 19 places in 189 ms
[2020-05-21 00:05:36] [INFO ] Deduced a trap composed of 29 places in 268 ms
[2020-05-21 00:05:37] [INFO ] Deduced a trap composed of 29 places in 299 ms
[2020-05-21 00:05:38] [INFO ] Deduced a trap composed of 28 places in 1333 ms
[2020-05-21 00:05:39] [INFO ] Deduced a trap composed of 19 places in 1230 ms
[2020-05-21 00:05:39] [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 s11 s16 s18 s20 s22 s23 s24 s30 s31 s32 s33 s44 s58 s64 s78 s121 s122 s179) 0)") while checking expression at index 0
Graph (trivial) has 244 edges and 189 vertex of which 100 / 189 are part of one of the 20 SCC in 24 ms
Free SCC test removed 80 places
Drop transitions removed 160 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 0 with 220 rules applied. Total rules applied 221 place count 109 transition count 179
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 227 place count 106 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 228 place count 106 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 229 place count 105 transition count 187
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 232 place count 105 transition count 187
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 237 place count 105 transition count 187
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 2 with 19 rules applied. Total rules applied 256 place count 105 transition count 168
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 269 place count 105 transition count 168
Applied a total of 269 rules in 107 ms. Remains 105 /189 variables (removed 84) and now considering 168/399 (removed 231) transitions.
// Phase 1: matrix 168 rows 105 cols
[2020-05-21 00:05:39] [INFO ] Computed 19 place invariants in 1 ms
[2020-05-21 00:05:39] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned sat
[2020-05-21 00:05:39] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2020-05-21 00:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 00:05:40] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2020-05-21 00:05:40] [INFO ] Computed and/alt/rep : 158/689/158 causal constraints in 33 ms.
[2020-05-21 00:05:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 00:05:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 63 ms returned sat
[2020-05-21 00:05:40] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 29 ms returned sat
[2020-05-21 00:05:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 00:05:40] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2020-05-21 00:05:40] [INFO ] Computed and/alt/rep : 158/689/158 causal constraints in 36 ms.
[2020-05-21 00:05:41] [INFO ] Added : 152 causal constraints over 31 iterations in 750 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-05-21 00:05:41] [INFO ] Flatten gal took : 136 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 00:05:42] [INFO ] Applying decomposition
[2020-05-21 00:05:42] [INFO ] Flatten gal took : 75 ms
[2020-05-21 00:05:42] [INFO ] Flatten gal took : 48 ms
[2020-05-21 00:05:42] [INFO ] Input system was already deterministic with 399 transitions.
[2020-05-21 00:05:42] [INFO ] Input system was already deterministic with 399 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph2118470245454135446.txt, -o, /tmp/graph2118470245454135446.bin, -w, /tmp/graph2118470245454135446.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph2118470245454135446.bin, -l, -1, -v, -w, /tmp/graph2118470245454135446.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 00:05:42] [INFO ] Decomposing Gal with order
[2020-05-21 00:05:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 00:05:43] [INFO ] Removed a total of 397 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 339 out of 399 initially.
// Phase 1: matrix 339 rows 189 cols
[2020-05-21 00:05:43] [INFO ] Computed 19 place invariants in 2 ms
inv : turn_10 + turn_11 + turn_12 + turn_13 + turn_14 = 1
inv : wantSection_4 + askForSection_8 + testTurn_8 + testTurn_9 + testTurn_10 + testTurn_11 + beginLoop_40 + beginLoop_45 + beginLoop_50 + beginLoop_55 + endTurn_8 + endTurn_9 + endTurn_10 + endTurn_11 + CS_2 + isEndLoop_40 + isEndLoop_41 + isEndLoop_43 + isEndLoop_44 + isEndLoop_45 + isEndLoop_46 + isEndLoop_48 + isEndLoop_49 + isEndLoop_50 + isEndLoop_51 + isEndLoop_53 + isEndLoop_54 + isEndLoop_55 + isEndLoop_56 + isEndLoop_58 + isEndLoop_59 = 1
inv : wantSection_3 - askForSection_4 - testTurn_4 - testTurn_5 - testTurn_6 - testTurn_7 - beginLoop_20 - beginLoop_25 - beginLoop_30 - beginLoop_35 - endTurn_4 - endTurn_5 - endTurn_6 - endTurn_7 - CS_1 - isEndLoop_20 - isEndLoop_22 - isEndLoop_23 - isEndLoop_24 - isEndLoop_25 - isEndLoop_27 - isEndLoop_28 - isEndLoop_29 - isEndLoop_30 - isEndLoop_32 - isEndLoop_33 - isEndLoop_34 - isEndLoop_35 - isEndLoop_37 - isEndLoop_38 - isEndLoop_39 = 0
inv : wantSection_8 + askForSection_16 + testTurn_16 + testTurn_17 + testTurn_18 + testTurn_19 + beginLoop_80 + beginLoop_85 + beginLoop_90 + beginLoop_95 + endTurn_16 + endTurn_17 + endTurn_18 + endTurn_19 + CS_4 + isEndLoop_80 + isEndLoop_81 + isEndLoop_82 + isEndLoop_83 + isEndLoop_84 + isEndLoop_85 + isEndLoop_86 + isEndLoop_87 + isEndLoop_88 + isEndLoop_89 + isEndLoop_90 + isEndLoop_91 + isEndLoop_92 + isEndLoop_93 + isEndLoop_94 + isEndLoop_95 + isEndLoop_96 + isEndLoop_97 + isEndLoop_98 + isEndLoop_99 = 1
inv : turn_5 + turn_6 + turn_7 + turn_8 + turn_9 = 1
inv : turn_0 + turn_1 + turn_2 + turn_3 + turn_4 = 1
inv : wantSection_9 - askForSection_16 - testTurn_16 - testTurn_17 - testTurn_18 - testTurn_19 - beginLoop_80 - beginLoop_85 - beginLoop_90 - beginLoop_95 - endTurn_16 - endTurn_17 - endTurn_18 - endTurn_19 - CS_4 - isEndLoop_80 - isEndLoop_81 - isEndLoop_82 - isEndLoop_83 - isEndLoop_84 - isEndLoop_85 - isEndLoop_86 - isEndLoop_87 - isEndLoop_88 - isEndLoop_89 - isEndLoop_90 - isEndLoop_91 - isEndLoop_92 - isEndLoop_93 - isEndLoop_94 - isEndLoop_95 - isEndLoop_96 - isEndLoop_97 - isEndLoop_98 - isEndLoop_99 = 0
inv : wantSection_6 + askForSection_12 + testTurn_12 + testTurn_13 + testTurn_14 + testTurn_15 + beginLoop_60 + beginLoop_65 + beginLoop_70 + beginLoop_75 + endTurn_12 + endTurn_13 + endTurn_14 + endTurn_15 + CS_3 + isEndLoop_60 + isEndLoop_61 + isEndLoop_62 + isEndLoop_64 + isEndLoop_65 + isEndLoop_66 + isEndLoop_67 + isEndLoop_69 + isEndLoop_70 + isEndLoop_71 + isEndLoop_72 + isEndLoop_74 + isEndLoop_75 + isEndLoop_76 + isEndLoop_77 + isEndLoop_79 = 1
inv : idle_4 + askForSection_16 + testTurn_16 + testTurn_17 + testTurn_18 + testTurn_19 + beginLoop_80 + beginLoop_85 + beginLoop_90 + beginLoop_95 + endTurn_16 + endTurn_17 + endTurn_18 + endTurn_19 + CS_4 + isEndLoop_80 + isEndLoop_81 + isEndLoop_82 + isEndLoop_83 + isEndLoop_84 + isEndLoop_85 + isEndLoop_86 + isEndLoop_87 + isEndLoop_88 + isEndLoop_89 + isEndLoop_90 + isEndLoop_91 + isEndLoop_92 + isEndLoop_93 + isEndLoop_94 + isEndLoop_95 + isEndLoop_96 + isEndLoop_97 + isEndLoop_98 + isEndLoop_99 = 1
inv : wantSection_1 - askForSection_0 - testTurn_0 - testTurn_1 - testTurn_2 - testTurn_3 - beginLoop_0 - beginLoop_5 - beginLoop_10 - beginLoop_15 - endTurn_0 - endTurn_1 - endTurn_2 - endTurn_3 - CS_0 - isEndLoop_1 - isEndLoop_2 - isEndLoop_3 - isEndLoop_4 - isEndLoop_6 - isEndLoop_7 - isEndLoop_8 - isEndLoop_9 - isEndLoop_11 - isEndLoop_12 - isEndLoop_13 - isEndLoop_14 - isEndLoop_16 - isEndLoop_17 - isEndLoop_18 - isEndLoop_19 = 0
inv : idle_2 + askForSection_8 + testTurn_8 + testTurn_9 + testTurn_10 + testTurn_11 + beginLoop_40 + beginLoop_45 + beginLoop_50 + beginLoop_55 + endTurn_8 + endTurn_9 + endTurn_10 + endTurn_11 + CS_2 + isEndLoop_40 + isEndLoop_41 + isEndLoop_43 + isEndLoop_44 + isEndLoop_45 + isEndLoop_46 + isEndLoop_48 + isEndLoop_49 + isEndLoop_50 + isEndLoop_51 + isEndLoop_53 + isEndLoop_54 + isEndLoop_55 + isEndLoop_56 + isEndLoop_58 + isEndLoop_59 = 1
inv : wantSection_7 - askForSection_12 - testTurn_12 - testTurn_13 - testTurn_14 - testTurn_15 - beginLoop_60 - beginLoop_65 - beginLoop_70 - beginLoop_75 - endTurn_12 - endTurn_13 - endTurn_14 - endTurn_15 - CS_3 - isEndLoop_60 - isEndLoop_61 - isEndLoop_62 - isEndLoop_64 - isEndLoop_65 - isEndLoop_66 - isEndLoop_67 - isEndLoop_69 - isEndLoop_70 - isEndLoop_71 - isEndLoop_72 - isEndLoop_74 - isEndLoop_75 - isEndLoop_76 - isEndLoop_77 - isEndLoop_79 = 0
inv : wantSection_0 + askForSection_0 + testTurn_0 + testTurn_1 + testTurn_2 + testTurn_3 + beginLoop_0 + beginLoop_5 + beginLoop_10 + beginLoop_15 + endTurn_0 + endTurn_1 + endTurn_2 + endTurn_3 + CS_0 + isEndLoop_1 + isEndLoop_2 + isEndLoop_3 + isEndLoop_4 + isEndLoop_6 + isEndLoop_7 + isEndLoop_8 + isEndLoop_9 + isEndLoop_11 + isEndLoop_12 + isEndLoop_13 + isEndLoop_14 + isEndLoop_16 + isEndLoop_17 + isEndLoop_18 + isEndLoop_19 = 1
inv : idle_3 + askForSection_12 + testTurn_12 + testTurn_13 + testTurn_14 + testTurn_15 + beginLoop_60 + beginLoop_65 + beginLoop_70 + beginLoop_75 + endTurn_12 + endTurn_13 + endTurn_14 + endTurn_15 + CS_3 + isEndLoop_60 + isEndLoop_61 + isEndLoop_62 + isEndLoop_64 + isEndLoop_65 + isEndLoop_66 + isEndLoop_67 + isEndLoop_69 + isEndLoop_70 + isEndLoop_71 + isEndLoop_72 + isEndLoop_74 + isEndLoop_75 + isEndLoop_76 + isEndLoop_77 + isEndLoop_79 = 1
inv : idle_1 + askForSection_4 + testTurn_4 + testTurn_5 + testTurn_6 + testTurn_7 + beginLoop_20 + beginLoop_25 + beginLoop_30 + beginLoop_35 + endTurn_4 + endTurn_5 + endTurn_6 + endTurn_7 + CS_1 + isEndLoop_20 + isEndLoop_22 + isEndLoop_23 + isEndLoop_24 + isEndLoop_25 + isEndLoop_27 + isEndLoop_28 + isEndLoop_29 + isEndLoop_30 + isEndLoop_32 + isEndLoop_33 + isEndLoop_34 + isEndLoop_35 + isEndLoop_37 + isEndLoop_38 + isEndLoop_39 = 1
inv : turn_15 + turn_16 + turn_17 + turn_18 + turn_19 = 1
inv : wantSection_2 + askForSection_4 + testTurn_4 + testTurn_5 + testTurn_6 + testTurn_7 + beginLoop_20 + beginLoop_25 + beginLoop_30 + beginLoop_35 + endTurn_4 + endTurn_5 + endTurn_6 + endTurn_7 + CS_1 + isEndLoop_20 + isEndLoop_22 + isEndLoop_23 + isEndLoop_24 + isEndLoop_25 + isEndLoop_27 + isEndLoop_28 + isEndLoop_29 + isEndLoop_30 + isEndLoop_32 + isEndLoop_33 + isEndLoop_34 + isEndLoop_35 + isEndLoop_37 + isEndLoop_38 + isEndLoop_39 = 1
inv : idle_0 + askForSection_0 + testTurn_0 + testTurn_1 + testTurn_2 + testTurn_3 + beginLoop_0 + beginLoop_5 + beginLoop_10 + beginLoop_15 + endTurn_0 + endTurn_1 + endTurn_2 + endTurn_3 + CS_0 + isEndLoop_1 + isEndLoop_2 + isEndLoop_3 + isEndLoop_4 + isEndLoop_6 + isEndLoop_7 + isEndLoop_8 + isEndLoop_9 + isEndLoop_11 + isEndLoop_12 + isEndLoop_13 + isEndLoop_14 + isEndLoop_16 + isEndLoop_17 + isEndLoop_18 + isEndLoop_19 = 1
inv : wantSection_5 - askForSection_8 - testTurn_8 - testTurn_9 - testTurn_10 - testTurn_11 - beginLoop_40 - beginLoop_45 - beginLoop_50 - beginLoop_55 - endTurn_8 - endTurn_9 - endTurn_10 - endTurn_11 - CS_2 - isEndLoop_40 - isEndLoop_41 - isEndLoop_43 - isEndLoop_44 - isEndLoop_45 - isEndLoop_46 - isEndLoop_48 - isEndLoop_49 - isEndLoop_50 - isEndLoop_51 - isEndLoop_53 - isEndLoop_54 - isEndLoop_55 - isEndLoop_56 - isEndLoop_58 - isEndLoop_59 = 0
Total of 19 invariants.
[2020-05-21 00:05:43] [INFO ] Computed 19 place invariants in 3 ms
[2020-05-21 00:05:43] [INFO ] Flatten gal took : 482 ms
[2020-05-21 00:05:43] [INFO ] Ran tautology test, simplified 0 / 1 in 1212 ms.
[2020-05-21 00:05:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 62 ms.
[2020-05-21 00:05:43] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 9 ms
[2020-05-21 00:05:43] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-09(UNSAT) depth K=0 took 88 ms
[2020-05-21 00:05:43] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-09(UNSAT) depth K=1 took 35 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 339 out of 399 initially.
// Phase 1: matrix 339 rows 189 cols
[2020-05-21 00:05:43] [INFO ] Computed 19 place invariants in 2 ms
inv : turn_10 + turn_11 + turn_12 + turn_13 + turn_14 = 1
inv : wantSection_4 + askForSection_8 + testTurn_8 + testTurn_9 + testTurn_10 + testTurn_11 + beginLoop_40 + beginLoop_45 + beginLoop_50 + beginLoop_55 + endTurn_8 + endTurn_9 + endTurn_10 + endTurn_11 + CS_2 + isEndLoop_40 + isEndLoop_41 + isEndLoop_43 + isEndLoop_44 + isEndLoop_45 + isEndLoop_46 + isEndLoop_48 + isEndLoop_49 + isEndLoop_50 + isEndLoop_51 + isEndLoop_53 + isEndLoop_54 + isEndLoop_55 + isEndLoop_56 + isEndLoop_58 + isEndLoop_59 = 1
inv : wantSection_3 - askForSection_4 - testTurn_4 - testTurn_5 - testTurn_6 - testTurn_7 - beginLoop_20 - beginLoop_25 - beginLoop_30 - beginLoop_35 - endTurn_4 - endTurn_5 - endTurn_6 - endTurn_7 - CS_1 - isEndLoop_20 - isEndLoop_22 - isEndLoop_23 - isEndLoop_24 - isEndLoop_25 - isEndLoop_27 - isEndLoop_28 - isEndLoop_29 - isEndLoop_30 - isEndLoop_32 - isEndLoop_33 - isEndLoop_34 - isEndLoop_35 - isEndLoop_37 - isEndLoop_38 - isEndLoop_39 = 0
inv : wantSection_8 + askForSection_16 + testTurn_16 + testTurn_17 + testTurn_18 + testTurn_19 + beginLoop_80 + beginLoop_85 + beginLoop_90 + beginLoop_95 + endTurn_16 + endTurn_17 + endTurn_18 + endTurn_19 + CS_4 + isEndLoop_80 + isEndLoop_81 + isEndLoop_82 + isEndLoop_83 + isEndLoop_84 + isEndLoop_85 + isEndLoop_86 + isEndLoop_87 + isEndLoop_88 + isEndLoop_89 + isEndLoop_90 + isEndLoop_91 + isEndLoop_92 + isEndLoop_93 + isEndLoop_94 + isEndLoop_95 + isEndLoop_96 + isEndLoop_97 + isEndLoop_98 + isEndLoop_99 = 1
inv : turn_5 + turn_6 + turn_7 + turn_8 + turn_9 = 1
inv : turn_0 + turn_1 + turn_2 + turn_3 + turn_4 = 1
inv : wantSection_9 - askForSection_16 - testTurn_16 - testTurn_17 - testTurn_18 - testTurn_19 - beginLoop_80 - beginLoop_85 - beginLoop_90 - beginLoop_95 - endTurn_16 - endTurn_17 - endTurn_18 - endTurn_19 - CS_4 - isEndLoop_80 - isEndLoop_81 - isEndLoop_82 - isEndLoop_83 - isEndLoop_84 - isEndLoop_85 - isEndLoop_86 - isEndLoop_87 - isEndLoop_88 - isEndLoop_89 - isEndLoop_90 - isEndLoop_91 - isEndLoop_92 - isEndLoop_93 - isEndLoop_94 - isEndLoop_95 - isEndLoop_96 - isEndLoop_97 - isEndLoop_98 - isEndLoop_99 = 0
inv : wantSection_6 + askForSection_12 + testTurn_12 + testTurn_13 + testTurn_14 + testTurn_15 + beginLoop_60 + beginLoop_65 + beginLoop_70 + beginLoop_75 + endTurn_12 + endTurn_13 + endTurn_14 + endTurn_15 + CS_3 + isEndLoop_60 + isEndLoop_61 + isEndLoop_62 + isEndLoop_64 + isEndLoop_65 + isEndLoop_66 + isEndLoop_67 + isEndLoop_69 + isEndLoop_70 + isEndLoop_71 + isEndLoop_72 + isEndLoop_74 + isEndLoop_75 + isEndLoop_76 + isEndLoop_77 + isEndLoop_79 = 1
inv : idle_4 + askForSection_16 + testTurn_16 + testTurn_17 + testTurn_18 + testTurn_19 + beginLoop_80 + beginLoop_85 + beginLoop_90 + beginLoop_95 + endTurn_16 + endTurn_17 + endTurn_18 + endTurn_19 + CS_4 + isEndLoop_80 + isEndLoop_81 + isEndLoop_82 + isEndLoop_83 + isEndLoop_84 + isEndLoop_85 + isEndLoop_86 + isEndLoop_87 + isEndLoop_88 + isEndLoop_89 + isEndLoop_90 + isEndLoop_91 + isEndLoop_92 + isEndLoop_93 + isEndLoop_94 + isEndLoop_95 + isEndLoop_96 + isEndLoop_97 + isEndLoop_98 + isEndLoop_99 = 1
inv : wantSection_1 - askForSection_0 - testTurn_0 - testTurn_1 - testTurn_2 - testTurn_3 - beginLoop_0 - beginLoop_5 - beginLoop_10 - beginLoop_15 - endTurn_0 - endTurn_1 - endTurn_2 - endTurn_3 - CS_0 - isEndLoop_1 - isEndLoop_2 - isEndLoop_3 - isEndLoop_4 - isEndLoop_6 - isEndLoop_7 - isEndLoop_8 - isEndLoop_9 - isEndLoop_11 - isEndLoop_12 - isEndLoop_13 - isEndLoop_14 - isEndLoop_16 - isEndLoop_17 - isEndLoop_18 - isEndLoop_19 = 0
inv : idle_2 + askForSection_8 + testTurn_8 + testTurn_9 + testTurn_10 + testTurn_11 + beginLoop_40 + beginLoop_45 + beginLoop_50 + beginLoop_55 + endTurn_8 + endTurn_9 + endTurn_10 + endTurn_11 + CS_2 + isEndLoop_40 + isEndLoop_41 + isEndLoop_43 + isEndLoop_44 + isEndLoop_45 + isEndLoop_46 + isEndLoop_48 + isEndLoop_49 + isEndLoop_50 + isEndLoop_51 + isEndLoop_53 + isEndLoop_54 + isEndLoop_55 + isEndLoop_56 + isEndLoop_58 + isEndLoop_59 = 1
inv : wantSection_7 - askForSection_12 - testTurn_12 - testTurn_13 - testTurn_14 - testTurn_15 - beginLoop_60 - beginLoop_65 - beginLoop_70 - beginLoop_75 - endTurn_12 - endTurn_13 - endTurn_14 - endTurn_15 - CS_3 - isEndLoop_60 - isEndLoop_61 - isEndLoop_62 - isEndLoop_64 - isEndLoop_65 - isEndLoop_66 - isEndLoop_67 - isEndLoop_69 - isEndLoop_70 - isEndLoop_71 - isEndLoop_72 - isEndLoop_74 - isEndLoop_75 - isEndLoop_76 - isEndLoop_77 - isEndLoop_79 = 0
inv : wantSection_0 + askForSection_0 + testTurn_0 + testTurn_1 + testTurn_2 + testTurn_3 + beginLoop_0 + beginLoop_5 + beginLoop_10 + beginLoop_15 + endTurn_0 + endTurn_1 + endTurn_2 + endTurn_3 + CS_0 + isEndLoop_1 + isEndLoop_2 + isEndLoop_3 + isEndLoop_4 + isEndLoop_6 + isEndLoop_7 + isEndLoop_8 + isEndLoop_9 + isEndLoop_11 + isEndLoop_12 + isEndLoop_13 + isEndLoop_14 + isEndLoop_16 + isEndLoop_17 + isEndLoop_18 + isEndLoop_19 = 1
inv : idle_3 + askForSection_12 + testTurn_12 + testTurn_13 + testTurn_14 + testTurn_15 + beginLoop_60 + beginLoop_65 + beginLoop_70 + beginLoop_75 + endTurn_12 + endTurn_13 + endTurn_14 + endTurn_15 + CS_3 + isEndLoop_60 + isEndLoop_61 + isEndLoop_62 + isEndLoop_64 + isEndLoop_65 + isEndLoop_66 + isEndLoop_67 + isEndLoop_69 + isEndLoop_70 + isEndLoop_71 + isEndLoop_72 + isEndLoop_74 + isEndLoop_75 + isEndLoop_76 + isEndLoop_77 + isEndLoop_79 = 1
inv : idle_1 + askForSection_4 + testTurn_4 + testTurn_5 + testTurn_6 + testTurn_7 + beginLoop_20 + beginLoop_25 + beginLoop_30 + beginLoop_35 + endTurn_4 + endTurn_5 + endTurn_6 + endTurn_7 + CS_1 + isEndLoop_20 + isEndLoop_22 + isEndLoop_23 + isEndLoop_24 + isEndLoop_25 + isEndLoop_27 + isEndLoop_28 + isEndLoop_29 + isEndLoop_30 + isEndLoop_32 + isEndLoop_33 + isEndLoop_34 + isEndLoop_35 + isEndLoop_37 + isEndLoop_38 + isEndLoop_39 = 1
inv : turn_15 + turn_16 + turn_17 + turn_18 + turn_19 = 1
inv : wantSection_2 + askForSection_4 + testTurn_4 + testTurn_5 + testTurn_6 + testTurn_7 + beginLoop_20 + beginLoop_25 + beginLoop_30 + beginLoop_35 + endTurn_4 + endTurn_5 + endTurn_6 + endTurn_7 + CS_1 + isEndLoop_20 + isEndLoop_22 + isEndLoop_23 + isEndLoop_24 + isEndLoop_25 + isEndLoop_27 + isEndLoop_28 + isEndLoop_29 + isEndLoop_30 + isEndLoop_32 + isEndLoop_33 + isEndLoop_34 + isEndLoop_35 + isEndLoop_37 + isEndLoop_38 + isEndLoop_39 = 1
inv : idle_0 + askForSection_0 + testTurn_0 + testTurn_1 + testTurn_2 + testTurn_3 + beginLoop_0 + beginLoop_5 + beginLoop_10 + beginLoop_15 + endTurn_0 + endTurn_1 + endTurn_2 + endTurn_3 + CS_0 + isEndLoop_1 + isEndLoop_2 + isEndLoop_3 + isEndLoop_4 + isEndLoop_6 + isEndLoop_7 + isEndLoop_8 + isEndLoop_9 + isEndLoop_11 + isEndLoop_12 + isEndLoop_13 + isEndLoop_14 + isEndLoop_16 + isEndLoop_17 + isEndLoop_18 + isEndLoop_19 = 1
inv : wantSection_5 - askForSection_8 - testTurn_8 - testTurn_9 - testTurn_10 - testTurn_11 - beginLoop_40 - beginLoop_45 - beginLoop_50 - beginLoop_55 - endTurn_8 - endTurn_9 - endTurn_10 - endTurn_11 - CS_2 - isEndLoop_40 - isEndLoop_41 - isEndLoop_43 - isEndLoop_44 - isEndLoop_45 - isEndLoop_46 - isEndLoop_48 - isEndLoop_49 - isEndLoop_50 - isEndLoop_51 - isEndLoop_53 - isEndLoop_54 - isEndLoop_55 - isEndLoop_56 - isEndLoop_58 - isEndLoop_59 = 0
Total of 19 invariants.
[2020-05-21 00:05:43] [INFO ] Computed 19 place invariants in 33 ms
[2020-05-21 00:05:43] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

[2020-05-21 00:05:44] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-09(UNSAT) depth K=2 took 346 ms
its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [reachable] property : Peterson-COL-4-ReachabilityFireability-09 with value :((((((((i6.i1.u3.idle_0>=1)&&(i6.i1.u3.wantSection_0>=1))||((i7.u1.idle_3>=1)&&(i7.u25.wantSection_6>=1)))||((i1.u4.idle_2>=1)&&(i1.u4.wantSection_4>=1)))||((i5.i0.u0.idle_1>=1)&&(i5.i0.u0.wantSection_2>=1)))||((i5.i1.u2.idle_4>=1)&&(i5.i1.u2.wantSection_8>=1)))&&((((((((((((((((((((i2.u11.isEndLoop_54>=1)||(i7.u25.isEndLoop_84>=1))||(i1.u7.isEndLoop_19>=1))||(i4.u16.isEndLoop_49>=1))||(i6.i1.u27.isEndLoop_94>=1))||(i4.u8.isEndLoop_29>=1))||(i3.u17.isEndLoop_59>=1))||(i0.u14.isEndLoop_24>=1))||(i6.i0.u26.isEndLoop_89>=1))||(i3.u15.isEndLoop_39>=1))||(i0.u5.isEndLoop_4>=1))||(i5.i0.u19.isEndLoop_69>=1))||(i2.u9.isEndLoop_34>=1))||(i3.u28.isEndLoop_99>=1))||(i0.u18.isEndLoop_64>=1))||(i2.u13.isEndLoop_14>=1))||(i5.i1.u21.isEndLoop_79>=1))||(i0.u10.isEndLoop_44>=1))||(i5.i0.u20.isEndLoop_74>=1))||(i4.u6.isEndLoop_9>=1)))&&(((((i1.u7.endTurn_3>=1)||(i3.u24.endTurn_19>=1))||(i3.u15.endTurn_7>=1))||(i3.u17.endTurn_11>=1))||(i5.i1.u21.endTurn_15>=1)))
built 28 ordering constraints for composite.
built 27 ordering constraints for composite.
built 17 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 ordering constraints for composite.
built 29 ordering constraints for composite.
built 26 ordering constraints for composite.
built 15 ordering constraints for composite.
built 41 ordering constraints for composite.
built 41 ordering constraints for composite.
built 43 ordering constraints for composite.
built 46 ordering constraints for composite.
built 14 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
[2020-05-21 00:05:44] [INFO ] Proved 189 variables to be positive in 1005 ms
SDD proceeding with computation, new max is 1024
[2020-05-21 00:05:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-09
[2020-05-21 00:05:44] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-09(SAT) depth K=0 took 27 ms
[2020-05-21 00:05:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-09
[2020-05-21 00:05:44] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-09(SAT) depth K=1 took 87 ms
SDD proceeding with computation, new max is 2048
[2020-05-21 00:05:45] [INFO ] Proved 189 variables to be positive in 2857 ms
[2020-05-21 00:05:45] [INFO ] Computing symmetric may disable matrix : 399 transitions.
[2020-05-21 00:05:45] [INFO ] Computation of disable matrix completed :0/399 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation, new max is 4096
[2020-05-21 00:05:46] [INFO ] Computation of Complete disable matrix. took 169 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 00:05:46] [INFO ] Computing symmetric may enable matrix : 399 transitions.
[2020-05-21 00:05:46] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 00:05:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-09
[2020-05-21 00:05:46] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-09(SAT) depth K=2 took 1353 ms
[2020-05-21 00:05:46] [INFO ] Computing symmetric co enabling matrix : 399 transitions.
[2020-05-21 00:05:48] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-09(UNSAT) depth K=3 took 4596 ms
SDD proceeding with computation, new max is 8192
[2020-05-21 00:05:49] [INFO ] Computation of co-enabling matrix(7/399) took 2744 ms. Total solver calls (SAT/UNSAT): 918(152/766)
[2020-05-21 00:05:52] [INFO ] Computation of co-enabling matrix(14/399) took 5925 ms. Total solver calls (SAT/UNSAT): 1919(315/1604)
SDD proceeding with computation, new max is 16384
[2020-05-21 00:05:55] [INFO ] Computation of co-enabling matrix(19/399) took 8941 ms. Total solver calls (SAT/UNSAT): 2604(425/2179)
[2020-05-21 00:05:59] [INFO ] Computation of co-enabling matrix(22/399) took 12317 ms. Total solver calls (SAT/UNSAT): 3003(488/2515)
[2020-05-21 00:06:02] [INFO ] Computation of co-enabling matrix(26/399) took 15854 ms. Total solver calls (SAT/UNSAT): 3529(570/2959)
[2020-05-21 00:06:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-4-ReachabilityFireability-09
[2020-05-21 00:06:04] [INFO ] KInduction solution for property Peterson-COL-4-ReachabilityFireability-09(SAT) depth K=3 took 18034 ms
[2020-05-21 00:06:06] [INFO ] Computation of co-enabling matrix(31/399) took 19375 ms. Total solver calls (SAT/UNSAT): 4166(670/3496)
[2020-05-21 00:06:09] [INFO ] Computation of co-enabling matrix(35/399) took 22685 ms. Total solver calls (SAT/UNSAT): 4676(754/3922)
SDD proceeding with computation, new max is 32768
[2020-05-21 00:06:12] [INFO ] BMC solution for property Peterson-COL-4-ReachabilityFireability-09(UNSAT) depth K=4 took 23643 ms
[2020-05-21 00:06:12] [INFO ] Computation of co-enabling matrix(42/399) took 25938 ms. Total solver calls (SAT/UNSAT): 5665(922/4743)
[2020-05-21 00:06:16] [INFO ] Computation of co-enabling matrix(45/399) took 29872 ms. Total solver calls (SAT/UNSAT): 6087(994/5093)
[2020-05-21 00:06:19] [INFO ] Computation of co-enabling matrix(48/399) took 33077 ms. Total solver calls (SAT/UNSAT): 6504(1066/5438)
[2020-05-21 00:06:23] [INFO ] Computation of co-enabling matrix(51/399) took 36376 ms. Total solver calls (SAT/UNSAT): 6876(1128/5748)
[2020-05-21 00:06:26] [INFO ] Computation of co-enabling matrix(55/399) took 39736 ms. Total solver calls (SAT/UNSAT): 7326(1203/6123)
[2020-05-21 00:06:29] [INFO ] Computation of co-enabling matrix(59/399) took 42873 ms. Total solver calls (SAT/UNSAT): 7760(1275/6485)
[2020-05-21 00:06:33] [INFO ] Computation of co-enabling matrix(64/399) took 46405 ms. Total solver calls (SAT/UNSAT): 8280(1360/6920)
[2020-05-21 00:06:36] [INFO ] Computation of co-enabling matrix(67/399) took 49506 ms. Total solver calls (SAT/UNSAT): 8588(1408/7180)
[2020-05-21 00:06:39] [INFO ] Computation of co-enabling matrix(70/399) took 52929 ms. Total solver calls (SAT/UNSAT): 8923(1463/7460)
[2020-05-21 00:06:42] [INFO ] Computation of co-enabling matrix(73/399) took 56120 ms. Total solver calls (SAT/UNSAT): 9313(1532/7781)
[2020-05-21 00:06:46] [INFO ] Computation of co-enabling matrix(76/399) took 59457 ms. Total solver calls (SAT/UNSAT): 9694(1599/8095)
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,5.4972e+06,62.5922,730672,9010,1154,1.11448e+06,16959,866,2.37408e+06,180,149326,0
Total reachable state count : 5497200

Verifying 1 reachability properties.
Reachability property Peterson-COL-4-ReachabilityFireability-09 does not hold.
FORMULA Peterson-COL-4-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : Peterson-COL-4-ReachabilityFireability-09

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-COL-4-ReachabilityFireability-09,0,62.9775,730672,1,0,1.11448e+06,16959,958,2.37408e+06,190,149326,20970
[2020-05-21 00:06:48] [WARNING] Interrupting SMT solver.
[2020-05-21 00:06:48] [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:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 00:06:48] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-COL-4-ReachabilityFireability-09 K-induction depth 4
Exception in thread "Thread-5" 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:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
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:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 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:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 00:06:48] [WARNING] Unexpected error occurred while running SMT. Was verifying Peterson-COL-4-ReachabilityFireability-09 SMT depth 5
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:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
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:384)
... 3 more
[2020-05-21 00:06:48] [INFO ] During BMC, SMT solver timed out at depth 5
[2020-05-21 00:06:48] [INFO ] BMC solving timed out (3600000 secs) at depth 5
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
[2020-05-21 00:06:48] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 00:06:48] [INFO ] Built C files in 65931ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590019609004

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-4"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Peterson-COL-4, 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 r111-csrt-158961258000679"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;