About the Execution of ITS-Tools for Referendum-PT-1000
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416000571.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-PT-1000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416000571
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 2.9M May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14M May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 659K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.6M May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 231K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 735K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 587K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 368K Mar 27 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Mar 27 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 418K Mar 25 13:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Mar 25 13:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 118K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 277K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-PT-1000-UpperBounds-00
FORMULA_NAME Referendum-PT-1000-UpperBounds-01
FORMULA_NAME Referendum-PT-1000-UpperBounds-02
FORMULA_NAME Referendum-PT-1000-UpperBounds-03
FORMULA_NAME Referendum-PT-1000-UpperBounds-04
FORMULA_NAME Referendum-PT-1000-UpperBounds-05
FORMULA_NAME Referendum-PT-1000-UpperBounds-06
FORMULA_NAME Referendum-PT-1000-UpperBounds-07
FORMULA_NAME Referendum-PT-1000-UpperBounds-08
FORMULA_NAME Referendum-PT-1000-UpperBounds-09
FORMULA_NAME Referendum-PT-1000-UpperBounds-10
FORMULA_NAME Referendum-PT-1000-UpperBounds-11
FORMULA_NAME Referendum-PT-1000-UpperBounds-12
FORMULA_NAME Referendum-PT-1000-UpperBounds-13
FORMULA_NAME Referendum-PT-1000-UpperBounds-14
FORMULA_NAME Referendum-PT-1000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1621260995492
Running Version 0
[2021-05-17 14:16:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:16:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:16:37] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2021-05-17 14:16:37] [INFO ] Transformed 3001 places.
[2021-05-17 14:16:37] [INFO ] Transformed 2001 transitions.
[2021-05-17 14:16:37] [INFO ] Found NUPN structural information;
[2021-05-17 14:16:37] [INFO ] Parsed PT model containing 3001 places and 2001 transitions in 167 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 117 ms.
// Phase 1: matrix 2001 rows 3001 cols
[2021-05-17 14:16:37] [INFO ] Computed 1000 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 3974 ms. (steps per millisecond=2 ) properties (out of 16) seen :6573
FORMULA Referendum-PT-1000-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-07 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-06 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-05 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-04 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Referendum-PT-1000-UpperBounds-03 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 3) seen :2
// Phase 1: matrix 2001 rows 3001 cols
[2021-05-17 14:16:42] [INFO ] Computed 1000 place invariants in 25 ms
[2021-05-17 14:16:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 250 ms returned sat
[2021-05-17 14:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:16:44] [INFO ] [Real]Absence check using state equation in 1229 ms returned sat
[2021-05-17 14:16:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:16:51] [INFO ] [Real]Absence check using 1000 positive place invariants in 313 ms returned sat
[2021-05-17 14:16:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:16:52] [INFO ] [Real]Absence check using state equation in 1082 ms returned sat
[2021-05-17 14:16:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:16:58] [INFO ] [Real]Absence check using 1000 positive place invariants in 273 ms returned sat
[2021-05-17 14:16:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:16:59] [INFO ] [Real]Absence check using state equation in 915 ms returned sat
[2021-05-17 14:16:59] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[522, 522, 521]
Support contains 2000 out of 3001 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3001/3001 places, 2001/2001 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3000 transition count 2000
Applied a total of 1 rules in 534 ms. Remains 3000 /3001 variables (removed 1) and now considering 2000/2001 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3001 places, 2000/2001 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:17:04] [INFO ] Computed 1000 place invariants in 12 ms
Interrupted random walk after 163683 steps, including 163 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=534, 1=534, 2=545}
Interrupted Best-First random walk after 162945 steps, including 0 resets, run timeout after 5009 ms. (steps per millisecond=32 ) properties seen :{0=84, 1=84}
Interrupted Best-First random walk after 189398 steps, including 0 resets, run timeout after 5010 ms. (steps per millisecond=37 ) properties seen :{0=99, 1=99}
Interrupted Best-First random walk after 188397 steps, including 0 resets, run timeout after 5015 ms. (steps per millisecond=37 ) properties seen :{2=98}
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:17:49] [INFO ] Computed 1000 place invariants in 10 ms
[2021-05-17 14:17:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 225 ms returned sat
[2021-05-17 14:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:17:51] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2021-05-17 14:17:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:18:37] [INFO ] [Real]Absence check using 1000 positive place invariants in 295 ms returned sat
[2021-05-17 14:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:18:38] [INFO ] [Real]Absence check using state equation in 1041 ms returned sat
[2021-05-17 14:18:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:19:24] [INFO ] [Real]Absence check using 1000 positive place invariants in 254 ms returned sat
[2021-05-17 14:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:19:25] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2021-05-17 14:19:25] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[534, 534, 545]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 82 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 76 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:20:11] [INFO ] Computed 1000 place invariants in 10 ms
[2021-05-17 14:20:11] [INFO ] Implicit Places using invariants in 549 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:20:11] [INFO ] Computed 1000 place invariants in 5 ms
[2021-05-17 14:20:12] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
[2021-05-17 14:20:12] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:20:12] [INFO ] Computed 1000 place invariants in 11 ms
[2021-05-17 14:20:13] [INFO ] Dead Transitions using invariants and state equation in 1529 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:20:13] [INFO ] Computed 1000 place invariants in 3 ms
Interrupted random walk after 167052 steps, including 166 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=539, 1=539, 2=539}
Interrupted Best-First random walk after 190200 steps, including 0 resets, run timeout after 5008 ms. (steps per millisecond=37 ) properties seen :{0=99, 1=99}
Interrupted Best-First random walk after 189398 steps, including 0 resets, run timeout after 5003 ms. (steps per millisecond=37 ) properties seen :{0=99, 1=99}
Interrupted Best-First random walk after 190200 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=37 ) properties seen :{2=99}
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:20:58] [INFO ] Computed 1000 place invariants in 3 ms
[2021-05-17 14:20:59] [INFO ] [Real]Absence check using 1000 positive place invariants in 274 ms returned sat
[2021-05-17 14:20:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:21:00] [INFO ] [Real]Absence check using state equation in 884 ms returned sat
[2021-05-17 14:21:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:21:46] [INFO ] [Real]Absence check using 1000 positive place invariants in 245 ms returned sat
[2021-05-17 14:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:21:47] [INFO ] [Real]Absence check using state equation in 1056 ms returned sat
[2021-05-17 14:21:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:22:33] [INFO ] [Real]Absence check using 1000 positive place invariants in 271 ms returned sat
[2021-05-17 14:22:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:22:34] [INFO ] [Real]Absence check using state equation in 1032 ms returned sat
[2021-05-17 14:22:34] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[539, 539, 545]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 76 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 48 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:23:19] [INFO ] Computed 1000 place invariants in 5 ms
[2021-05-17 14:23:20] [INFO ] Implicit Places using invariants in 527 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:23:20] [INFO ] Computed 1000 place invariants in 7 ms
[2021-05-17 14:23:20] [INFO ] Implicit Places using invariants and state equation in 640 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
[2021-05-17 14:23:21] [INFO ] Redundant transitions in 170 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:23:21] [INFO ] Computed 1000 place invariants in 6 ms
[2021-05-17 14:23:22] [INFO ] Dead Transitions using invariants and state equation in 1249 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:23:22] [INFO ] Computed 1000 place invariants in 4 ms
Interrupted random walk after 156458 steps, including 156 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen :{0=537, 1=537, 2=531}
Interrupted Best-First random walk after 168432 steps, including 0 resets, run timeout after 5025 ms. (steps per millisecond=33 ) properties seen :{0=87, 1=87}
Interrupted Best-First random walk after 172080 steps, including 0 resets, run timeout after 5018 ms. (steps per millisecond=34 ) properties seen :{0=89, 1=89}
Interrupted Best-First random walk after 165777 steps, including 0 resets, run timeout after 5013 ms. (steps per millisecond=33 ) properties seen :{2=86}
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:24:07] [INFO ] Computed 1000 place invariants in 8 ms
[2021-05-17 14:24:08] [INFO ] [Real]Absence check using 1000 positive place invariants in 328 ms returned sat
[2021-05-17 14:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:24:09] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2021-05-17 14:24:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:24:55] [INFO ] [Real]Absence check using 1000 positive place invariants in 270 ms returned sat
[2021-05-17 14:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:24:56] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2021-05-17 14:24:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:25:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 260 ms returned sat
[2021-05-17 14:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:25:43] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2021-05-17 14:25:43] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000, 1000, 1000] Max seen :[539, 539, 545]
Support contains 2000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 80 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Applied a total of 0 rules in 47 ms. Remains 3000 /3000 variables (removed 0) and now considering 2000/2000 (removed 0) transitions.
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:26:29] [INFO ] Computed 1000 place invariants in 7 ms
[2021-05-17 14:26:29] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:26:29] [INFO ] Computed 1000 place invariants in 4 ms
[2021-05-17 14:26:30] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
[2021-05-17 14:26:30] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:26:30] [INFO ] Computed 1000 place invariants in 5 ms
[2021-05-17 14:26:31] [INFO ] Dead Transitions using invariants and state equation in 1586 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3000/3000 places, 2000/2000 transitions.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-00
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:26:31] [INFO ] Computed 1000 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1203 ms. (steps per millisecond=8 ) properties (out of 1) seen :519
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:26:33] [INFO ] Computed 1000 place invariants in 7 ms
[2021-05-17 14:26:34] [INFO ] [Real]Absence check using 1000 positive place invariants in 261 ms returned sat
[2021-05-17 14:26:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:26:35] [INFO ] [Real]Absence check using state equation in 1042 ms returned sat
[2021-05-17 14:26:35] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[519]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.9 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 134 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2021-05-17 14:26:40] [INFO ] Computed 1000 place invariants in 3 ms
Interrupted random walk after 332861 steps, including 332 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen :{0=1000}
FORMULA Referendum-PT-1000-UpperBounds-00 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-00 in 38763 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-01
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:27:10] [INFO ] Computed 1000 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1621 ms. (steps per millisecond=6 ) properties (out of 1) seen :519
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:27:12] [INFO ] Computed 1000 place invariants in 10 ms
[2021-05-17 14:27:13] [INFO ] [Real]Absence check using 1000 positive place invariants in 277 ms returned sat
[2021-05-17 14:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:27:14] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2021-05-17 14:27:14] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[519]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 100 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2021-05-17 14:27:19] [INFO ] Computed 1000 place invariants in 2 ms
Interrupted random walk after 341196 steps, including 340 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen :{0=1000}
FORMULA Referendum-PT-1000-UpperBounds-01 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-01 in 39127 ms.
Starting property specific reduction for Referendum-PT-1000-UpperBounds-02
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:27:49] [INFO ] Computed 1000 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 9 resets, run finished after 1639 ms. (steps per millisecond=6 ) properties (out of 1) seen :527
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 1) seen :2
// Phase 1: matrix 2000 rows 3000 cols
[2021-05-17 14:27:51] [INFO ] Computed 1000 place invariants in 6 ms
[2021-05-17 14:27:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 276 ms returned sat
[2021-05-17 14:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:27:53] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2021-05-17 14:27:53] [INFO ] Solution in real domain found non-integer solution.
Current structural bounds on expressions (after SMT) : [1000] Max seen :[527]
Support contains 1000 out of 3000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3000/3000 places, 2000/2000 transitions.
Graph (complete) has 2000 edges and 3000 vertex of which 2000 are kept as prefixes of interest. Removing 1000 places using SCC suffix rule.4 ms
Discarding 1000 places :
Also discarding 0 output transitions
Drop transitions removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 0 with 1000 rules applied. Total rules applied 1001 place count 2000 transition count 1000
Applied a total of 1001 rules in 68 ms. Remains 2000 /3000 variables (removed 1000) and now considering 1000/2000 (removed 1000) transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/3000 places, 1000/2000 transitions.
// Phase 1: matrix 1000 rows 2000 cols
[2021-05-17 14:27:58] [INFO ] Computed 1000 place invariants in 2 ms
Interrupted random walk after 354443 steps, including 354 resets, run timeout after 30001 ms. (steps per millisecond=11 ) properties seen :{0=1000}
FORMULA Referendum-PT-1000-UpperBounds-02 1000 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for Referendum-PT-1000-UpperBounds-02 in 39132 ms.
[2021-05-17 14:28:29] [INFO ] Flatten gal took : 283 ms
[2021-05-17 14:28:29] [INFO ] Applying decomposition
[2021-05-17 14:28:29] [INFO ] Flatten gal took : 62 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph689491016864278256.txt, -o, /tmp/graph689491016864278256.bin, -w, /tmp/graph689491016864278256.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph689491016864278256.bin, -l, -1, -v, -w, /tmp/graph689491016864278256.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 14:28:29] [INFO ] Decomposing Gal with order
[2021-05-17 14:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 14:28:30] [INFO ] Flatten gal took : 197 ms
[2021-05-17 14:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 14:28:30] [INFO ] Time to serialize gal into /tmp/UpperBounds16382374679350918383.gal : 43 ms
[2021-05-17 14:28:30] [INFO ] Time to serialize properties into /tmp/UpperBounds16427559079114564112.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16382374679350918383.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16427559079114564112.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16382374679350918383.gal -t CGAL -reachable-file /tmp/UpperBounds16427559079114564112.prop --nowitness
Loading property file /tmp/UpperBounds16427559079114564112.prop.
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,1.32207e+477,2.74427,37704,1002,6,3004,19,2008,0,10,11,0
Total reachable state count : 1.322070819480806635042229428124998147867e+477
BK_STOP 1621261713730
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="Referendum-PT-1000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Referendum-PT-1000, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089416000571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-1000.tgz
mv Referendum-PT-1000 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;