Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268400467.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PolyORBNT-PT-S05J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268400467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 171K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 672K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 203K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Mar 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 39K Mar 25 12:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 130K Mar 25 12:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.2K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 PolyORBNT-PT-S05J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S05J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621223669135

Running Version 0
[2021-05-17 03:54:32] [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 03:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 03:54:32] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2021-05-17 03:54:32] [INFO ] Transformed 909 places.
[2021-05-17 03:54:32] [INFO ] Transformed 1970 transitions.
[2021-05-17 03:54:32] [INFO ] Parsed PT model containing 909 places and 1970 transitions in 246 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Normalized transition count is 1311 out of 1315 initially.
// Phase 1: matrix 1311 rows 909 cols
[2021-05-17 03:54:33] [INFO ] Computed 142 place invariants in 247 ms
FORMULA PolyORBNT-PT-S05J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-05 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J60-UpperBounds-03 61 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 685 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 12) seen :20
FORMULA PolyORBNT-PT-S05J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 162 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10000 steps, including 142 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :16
FORMULA PolyORBNT-PT-S05J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-17 03:54:33] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2021-05-17 03:54:33] [INFO ] Computed 142 place invariants in 44 ms
[2021-05-17 03:54:34] [INFO ] [Real]Absence check using 111 positive place invariants in 44 ms returned sat
[2021-05-17 03:54:34] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 33 ms returned sat
[2021-05-17 03:54:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:54:34] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2021-05-17 03:54:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:54:35] [INFO ] [Nat]Absence check using 111 positive place invariants in 57 ms returned sat
[2021-05-17 03:54:35] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 70 ms returned sat
[2021-05-17 03:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:54:36] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2021-05-17 03:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:54:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 40 ms returned sat
[2021-05-17 03:54:36] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 233 ms.
[2021-05-17 03:54:37] [INFO ] Added : 17 causal constraints over 4 iterations in 1301 ms. Result :sat
Minimization took 294 ms.
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive place invariants in 42 ms returned sat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 37 ms returned unsat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive place invariants in 21 ms returned sat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 22 ms returned unsat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive place invariants in 20 ms returned sat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 23 ms returned unsat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 27 ms returned unsat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 19 ms returned unsat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive place invariants in 26 ms returned sat
[2021-05-17 03:54:38] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 4 ms returned unsat
[2021-05-17 03:54:39] [INFO ] [Real]Absence check using 111 positive place invariants in 47 ms returned sat
[2021-05-17 03:54:39] [INFO ] [Real]Absence check using 111 positive and 31 generalized place invariants in 48 ms returned sat
[2021-05-17 03:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:54:39] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2021-05-17 03:54:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:54:39] [INFO ] [Nat]Absence check using 111 positive place invariants in 20 ms returned sat
[2021-05-17 03:54:39] [INFO ] [Nat]Absence check using 111 positive and 31 generalized place invariants in 31 ms returned sat
[2021-05-17 03:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:54:41] [INFO ] [Nat]Absence check using state equation in 1874 ms returned sat
[2021-05-17 03:54:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 03:54:41] [INFO ] Computed and/alt/rep : 749/1769/749 causal constraints (skipped 556 transitions) in 165 ms.
[2021-05-17 03:54:44] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 5 ms to minimize.
[2021-05-17 03:54:45] [INFO ] Deduced a trap composed of 2 places in 919 ms of which 3 ms to minimize.
[2021-05-17 03:54: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 close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [262, 1, 4, 5, 1, 2, 1, 1] Max seen :[3, 1, 4, 5, 1, 2, 1, 0]
FORMULA PolyORBNT-PT-S05J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S05J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 5200 steps, including 321 resets, run finished after 34 ms. (steps per millisecond=152 ) properties (out of 2) seen :2 could not realise parikh vector
Support contains 2 out of 909 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 137 place count 838 transition count 1185
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 265 place count 774 transition count 1185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 266 place count 773 transition count 1184
Iterating global reduction 2 with 1 rules applied. Total rules applied 267 place count 773 transition count 1184
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 271 place count 771 transition count 1182
Applied a total of 271 rules in 359 ms. Remains 771 /909 variables (removed 138) and now considering 1182/1315 (removed 133) transitions.
[2021-05-17 03:54:46] [INFO ] Flow matrix only has 1178 transitions (discarded 4 similar events)
// Phase 1: matrix 1178 rows 771 cols
[2021-05-17 03:54:46] [INFO ] Computed 137 place invariants in 80 ms
[2021-05-17 03:54:47] [INFO ] Dead Transitions using invariants and state equation in 1906 ms returned [743, 745, 746, 747, 748, 751, 753, 755, 756, 757, 759, 760, 761, 762, 763, 764, 765, 766, 768, 769, 770, 771, 772, 773, 775, 776, 777, 778, 779, 780, 781, 782, 785, 787, 788, 790, 791, 792, 793, 794, 796, 797, 798, 799, 800, 801, 802, 803, 804, 806, 809, 810, 811, 812, 813, 814, 816, 818, 820, 822, 823, 824, 825, 829, 830, 831, 832, 833, 834, 835, 836, 838, 840, 842, 844, 845, 846, 848, 849, 850, 851, 852, 853, 854, 855, 856, 858, 859, 860, 862, 863, 864, 865, 866, 867]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[867, 866, 865, 864, 863, 862, 860, 859, 858, 856, 855, 854, 853, 852, 851, 850, 849, 848, 846, 845, 844, 842, 840, 838, 836, 835, 834, 833, 832, 831, 830, 829, 825, 824, 823, 822, 820, 818, 816, 814, 813, 812, 811, 810, 809, 806, 804, 803, 802, 801, 800, 799, 798, 797, 796, 794, 793, 792, 791, 790, 788, 787, 785, 782, 781, 780, 779, 778, 777, 776, 775, 773, 772, 771, 770, 769, 768, 766, 765, 764, 763, 762, 761, 760, 759, 757, 756, 755, 753, 751, 748, 747, 746, 745, 743]
Starting structural reductions, iteration 1 : 771/909 places, 1087/1315 transitions.
Applied a total of 0 rules in 43 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 771/909 places, 1087/1315 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:54:48] [INFO ] Computed 137 place invariants in 48 ms
Incomplete random walk after 1000000 steps, including 47099 resets, run finished after 5803 ms. (steps per millisecond=172 ) properties (out of 2) seen :4
FORMULA PolyORBNT-PT-S05J60-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3327 resets, run finished after 1160 ms. (steps per millisecond=862 ) properties (out of 1) seen :3
[2021-05-17 03:54:55] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:54:55] [INFO ] Computed 137 place invariants in 39 ms
[2021-05-17 03:54:55] [INFO ] [Real]Absence check using 112 positive place invariants in 18 ms returned sat
[2021-05-17 03:54:55] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-17 03:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:54:55] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2021-05-17 03:54:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:54:55] [INFO ] [Nat]Absence check using 112 positive place invariants in 17 ms returned sat
[2021-05-17 03:54:56] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-17 03:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:54:56] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2021-05-17 03:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:54:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 364 ms returned sat
[2021-05-17 03:54:57] [INFO ] Deduced a trap composed of 236 places in 455 ms of which 2 ms to minimize.
[2021-05-17 03:54:57] [INFO ] Deduced a trap composed of 239 places in 507 ms of which 0 ms to minimize.
[2021-05-17 03:54:58] [INFO ] Deduced a trap composed of 228 places in 295 ms of which 1 ms to minimize.
[2021-05-17 03:54:58] [INFO ] Deduced a trap composed of 268 places in 204 ms of which 0 ms to minimize.
[2021-05-17 03:54:58] [INFO ] Deduced a trap composed of 236 places in 223 ms of which 1 ms to minimize.
[2021-05-17 03:54:59] [INFO ] Deduced a trap composed of 249 places in 312 ms of which 2 ms to minimize.
[2021-05-17 03:54:59] [INFO ] Deduced a trap composed of 262 places in 260 ms of which 0 ms to minimize.
[2021-05-17 03:54:59] [INFO ] Deduced a trap composed of 235 places in 346 ms of which 2 ms to minimize.
[2021-05-17 03:55:00] [INFO ] Deduced a trap composed of 253 places in 235 ms of which 1 ms to minimize.
[2021-05-17 03:55:00] [INFO ] Deduced a trap composed of 274 places in 233 ms of which 0 ms to minimize.
[2021-05-17 03:55:00] [INFO ] Deduced a trap composed of 268 places in 250 ms of which 1 ms to minimize.
[2021-05-17 03:55:01] [INFO ] Deduced a trap composed of 250 places in 180 ms of which 1 ms to minimize.
[2021-05-17 03:55:02] [INFO ] Deduced a trap composed of 242 places in 224 ms of which 1 ms to minimize.
[2021-05-17 03:55:02] [INFO ] Deduced a trap composed of 230 places in 488 ms of which 1 ms to minimize.
[2021-05-17 03:55:02] [INFO ] Deduced a trap composed of 242 places in 177 ms of which 1 ms to minimize.
[2021-05-17 03:55:03] [INFO ] Deduced a trap composed of 276 places in 381 ms of which 1 ms to minimize.
[2021-05-17 03:55:04] [INFO ] Deduced a trap composed of 254 places in 284 ms of which 1 ms to minimize.
[2021-05-17 03:55:04] [INFO ] Deduced a trap composed of 249 places in 413 ms of which 1 ms to minimize.
[2021-05-17 03:55:05] [INFO ] Deduced a trap composed of 248 places in 400 ms of which 1 ms to minimize.
[2021-05-17 03:55:08] [INFO ] Deduced a trap composed of 254 places in 299 ms of which 26 ms to minimize.
[2021-05-17 03:55:08] [INFO ] Deduced a trap composed of 252 places in 436 ms of which 1 ms to minimize.
[2021-05-17 03:55:09] [INFO ] Deduced a trap composed of 239 places in 316 ms of which 0 ms to minimize.
[2021-05-17 03:55:09] [INFO ] Deduced a trap composed of 242 places in 220 ms of which 1 ms to minimize.
[2021-05-17 03:55:09] [INFO ] Deduced a trap composed of 242 places in 227 ms of which 0 ms to minimize.
[2021-05-17 03:55:10] [INFO ] Deduced a trap composed of 249 places in 333 ms of which 1 ms to minimize.
[2021-05-17 03:55:10] [INFO ] Deduced a trap composed of 263 places in 232 ms of which 1 ms to minimize.
[2021-05-17 03:55:41] [INFO ] Deduced a trap composed of 6 places in 513 ms of which 3 ms to minimize.
[2021-05-17 03:55:41] [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 close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [142] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 41 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:55:41] [INFO ] Computed 137 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 47261 resets, run finished after 5228 ms. (steps per millisecond=191 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3381 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 1) seen :3
[2021-05-17 03:55:47] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:55:47] [INFO ] Computed 137 place invariants in 29 ms
[2021-05-17 03:55:48] [INFO ] [Real]Absence check using 112 positive place invariants in 20 ms returned sat
[2021-05-17 03:55:48] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 46 ms returned sat
[2021-05-17 03:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:55:48] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2021-05-17 03:55:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:55:49] [INFO ] [Nat]Absence check using 112 positive place invariants in 21 ms returned sat
[2021-05-17 03:55:49] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 46 ms returned sat
[2021-05-17 03:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:55:49] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2021-05-17 03:55:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:55:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 370 ms returned sat
[2021-05-17 03:55:50] [INFO ] Deduced a trap composed of 236 places in 401 ms of which 1 ms to minimize.
[2021-05-17 03:55:50] [INFO ] Deduced a trap composed of 239 places in 253 ms of which 0 ms to minimize.
[2021-05-17 03:55:50] [INFO ] Deduced a trap composed of 228 places in 235 ms of which 1 ms to minimize.
[2021-05-17 03:55:51] [INFO ] Deduced a trap composed of 268 places in 171 ms of which 1 ms to minimize.
[2021-05-17 03:55:51] [INFO ] Deduced a trap composed of 236 places in 276 ms of which 4 ms to minimize.
[2021-05-17 03:55:51] [INFO ] Deduced a trap composed of 249 places in 214 ms of which 0 ms to minimize.
[2021-05-17 03:55:52] [INFO ] Deduced a trap composed of 262 places in 288 ms of which 1 ms to minimize.
[2021-05-17 03:55:52] [INFO ] Deduced a trap composed of 235 places in 198 ms of which 0 ms to minimize.
[2021-05-17 03:55:52] [INFO ] Deduced a trap composed of 253 places in 214 ms of which 1 ms to minimize.
[2021-05-17 03:55:53] [INFO ] Deduced a trap composed of 274 places in 232 ms of which 1 ms to minimize.
[2021-05-17 03:55:53] [INFO ] Deduced a trap composed of 268 places in 225 ms of which 2 ms to minimize.
[2021-05-17 03:55:54] [INFO ] Deduced a trap composed of 250 places in 175 ms of which 1 ms to minimize.
[2021-05-17 03:55:54] [INFO ] Deduced a trap composed of 242 places in 299 ms of which 1 ms to minimize.
[2021-05-17 03:55:55] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 0 ms to minimize.
[2021-05-17 03:55:55] [INFO ] Deduced a trap composed of 242 places in 422 ms of which 1 ms to minimize.
[2021-05-17 03:55:56] [INFO ] Deduced a trap composed of 276 places in 276 ms of which 1 ms to minimize.
[2021-05-17 03:55:56] [INFO ] Deduced a trap composed of 254 places in 395 ms of which 1 ms to minimize.
[2021-05-17 03:55:57] [INFO ] Deduced a trap composed of 249 places in 169 ms of which 1 ms to minimize.
[2021-05-17 03:55:57] [INFO ] Deduced a trap composed of 248 places in 310 ms of which 1 ms to minimize.
[2021-05-17 03:56:00] [INFO ] Deduced a trap composed of 254 places in 202 ms of which 0 ms to minimize.
[2021-05-17 03:56:01] [INFO ] Deduced a trap composed of 252 places in 225 ms of which 1 ms to minimize.
[2021-05-17 03:56:01] [INFO ] Deduced a trap composed of 239 places in 322 ms of which 1 ms to minimize.
[2021-05-17 03:56:01] [INFO ] Deduced a trap composed of 242 places in 291 ms of which 0 ms to minimize.
[2021-05-17 03:56:02] [INFO ] Deduced a trap composed of 242 places in 265 ms of which 1 ms to minimize.
[2021-05-17 03:56:02] [INFO ] Deduced a trap composed of 249 places in 222 ms of which 0 ms to minimize.
[2021-05-17 03:56:02] [INFO ] Deduced a trap composed of 263 places in 336 ms of which 1 ms to minimize.
[2021-05-17 03:56:34] [INFO ] Deduced a trap composed of 6 places in 480 ms of which 0 ms to minimize.
[2021-05-17 03:56: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 close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [142] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 53 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 58 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2021-05-17 03:56:34] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:56:34] [INFO ] Computed 137 place invariants in 21 ms
[2021-05-17 03:56:35] [INFO ] Implicit Places using invariants in 1431 ms returned []
[2021-05-17 03:56:35] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:56:35] [INFO ] Computed 137 place invariants in 39 ms
[2021-05-17 03:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:56:47] [INFO ] Implicit Places using invariants and state equation in 11821 ms returned []
Implicit Place search using SMT with State Equation took 13277 ms to find 0 implicit places.
[2021-05-17 03:56:47] [INFO ] Redundant transitions in 81 ms returned []
[2021-05-17 03:56:47] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:56:47] [INFO ] Computed 137 place invariants in 26 ms
[2021-05-17 03:56:49] [INFO ] Dead Transitions using invariants and state equation in 1565 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-00
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:56:49] [INFO ] Computed 137 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 479 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :3
[2021-05-17 03:56:49] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:56:49] [INFO ] Computed 137 place invariants in 25 ms
[2021-05-17 03:56:49] [INFO ] [Real]Absence check using 112 positive place invariants in 38 ms returned sat
[2021-05-17 03:56:49] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 34 ms returned sat
[2021-05-17 03:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:56:50] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2021-05-17 03:56:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:56:50] [INFO ] [Nat]Absence check using 112 positive place invariants in 33 ms returned sat
[2021-05-17 03:56:50] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 31 ms returned sat
[2021-05-17 03:56:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:56:51] [INFO ] [Nat]Absence check using state equation in 490 ms returned sat
[2021-05-17 03:56:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:56:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 385 ms returned sat
[2021-05-17 03:56:51] [INFO ] Deduced a trap composed of 236 places in 284 ms of which 1 ms to minimize.
[2021-05-17 03:56:52] [INFO ] Deduced a trap composed of 239 places in 373 ms of which 2 ms to minimize.
[2021-05-17 03:56:52] [INFO ] Deduced a trap composed of 228 places in 226 ms of which 0 ms to minimize.
[2021-05-17 03:56:52] [INFO ] Deduced a trap composed of 268 places in 187 ms of which 1 ms to minimize.
[2021-05-17 03:56:53] [INFO ] Deduced a trap composed of 236 places in 376 ms of which 1 ms to minimize.
[2021-05-17 03:56:53] [INFO ] Deduced a trap composed of 249 places in 244 ms of which 1 ms to minimize.
[2021-05-17 03:56:53] [INFO ] Deduced a trap composed of 262 places in 214 ms of which 0 ms to minimize.
[2021-05-17 03:56:54] [INFO ] Deduced a trap composed of 235 places in 373 ms of which 1 ms to minimize.
[2021-05-17 03:56:54] [INFO ] Deduced a trap composed of 253 places in 215 ms of which 3 ms to minimize.
[2021-05-17 03:56:54] [INFO ] Deduced a trap composed of 274 places in 359 ms of which 9 ms to minimize.
[2021-05-17 03:56:55] [INFO ] Deduced a trap composed of 268 places in 398 ms of which 11 ms to minimize.
[2021-05-17 03:56:55] [INFO ] Deduced a trap composed of 6 places in 566 ms of which 1 ms to minimize.
[2021-05-17 03:56:55] [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 close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [142] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 26 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2021-05-17 03:56:56] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:56:56] [INFO ] Computed 137 place invariants in 36 ms
[2021-05-17 03:56:57] [INFO ] Dead Transitions using invariants and state equation in 1209 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Normalized transition count is 1083 out of 1087 initially.
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:56:57] [INFO ] Computed 137 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 47286 resets, run finished after 4950 ms. (steps per millisecond=202 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 3319 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 1) seen :3
[2021-05-17 03:57:03] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:57:03] [INFO ] Computed 137 place invariants in 44 ms
[2021-05-17 03:57:03] [INFO ] [Real]Absence check using 112 positive place invariants in 16 ms returned sat
[2021-05-17 03:57:03] [INFO ] [Real]Absence check using 112 positive and 25 generalized place invariants in 16 ms returned sat
[2021-05-17 03:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 03:57:04] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2021-05-17 03:57:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 03:57:04] [INFO ] [Nat]Absence check using 112 positive place invariants in 34 ms returned sat
[2021-05-17 03:57:04] [INFO ] [Nat]Absence check using 112 positive and 25 generalized place invariants in 17 ms returned sat
[2021-05-17 03:57:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 03:57:04] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2021-05-17 03:57:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:57:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 359 ms returned sat
[2021-05-17 03:57:05] [INFO ] Deduced a trap composed of 236 places in 312 ms of which 1 ms to minimize.
[2021-05-17 03:57:05] [INFO ] Deduced a trap composed of 239 places in 268 ms of which 1 ms to minimize.
[2021-05-17 03:57:05] [INFO ] Deduced a trap composed of 228 places in 283 ms of which 1 ms to minimize.
[2021-05-17 03:57:06] [INFO ] Deduced a trap composed of 268 places in 193 ms of which 0 ms to minimize.
[2021-05-17 03:57:06] [INFO ] Deduced a trap composed of 236 places in 399 ms of which 1 ms to minimize.
[2021-05-17 03:57:06] [INFO ] Deduced a trap composed of 249 places in 282 ms of which 1 ms to minimize.
[2021-05-17 03:57:07] [INFO ] Deduced a trap composed of 262 places in 287 ms of which 1 ms to minimize.
[2021-05-17 03:57:07] [INFO ] Deduced a trap composed of 235 places in 216 ms of which 1 ms to minimize.
[2021-05-17 03:57:07] [INFO ] Deduced a trap composed of 253 places in 208 ms of which 0 ms to minimize.
[2021-05-17 03:57:08] [INFO ] Deduced a trap composed of 274 places in 193 ms of which 1 ms to minimize.
[2021-05-17 03:57:08] [INFO ] Deduced a trap composed of 268 places in 273 ms of which 1 ms to minimize.
[2021-05-17 03:57:09] [INFO ] Deduced a trap composed of 250 places in 477 ms of which 1 ms to minimize.
[2021-05-17 03:57:10] [INFO ] Deduced a trap composed of 242 places in 211 ms of which 0 ms to minimize.
[2021-05-17 03:57:10] [INFO ] Deduced a trap composed of 230 places in 216 ms of which 0 ms to minimize.
[2021-05-17 03:57:10] [INFO ] Deduced a trap composed of 242 places in 199 ms of which 0 ms to minimize.
[2021-05-17 03:57:11] [INFO ] Deduced a trap composed of 276 places in 354 ms of which 2 ms to minimize.
[2021-05-17 03:57:11] [INFO ] Deduced a trap composed of 254 places in 168 ms of which 1 ms to minimize.
[2021-05-17 03:57:12] [INFO ] Deduced a trap composed of 249 places in 225 ms of which 0 ms to minimize.
[2021-05-17 03:57:12] [INFO ] Deduced a trap composed of 248 places in 346 ms of which 1 ms to minimize.
[2021-05-17 03:57:15] [INFO ] Deduced a trap composed of 254 places in 417 ms of which 1 ms to minimize.
[2021-05-17 03:57:16] [INFO ] Deduced a trap composed of 252 places in 194 ms of which 0 ms to minimize.
[2021-05-17 03:57:16] [INFO ] Deduced a trap composed of 239 places in 420 ms of which 1 ms to minimize.
[2021-05-17 03:57:17] [INFO ] Deduced a trap composed of 242 places in 399 ms of which 1 ms to minimize.
[2021-05-17 03:57:17] [INFO ] Deduced a trap composed of 242 places in 397 ms of which 1 ms to minimize.
[2021-05-17 03:57:17] [INFO ] Deduced a trap composed of 249 places in 379 ms of which 1 ms to minimize.
[2021-05-17 03:57:18] [INFO ] Deduced a trap composed of 263 places in 418 ms of which 1 ms to minimize.
[2021-05-17 03:57:49] [INFO ] Deduced a trap composed of 6 places in 605 ms of which 2 ms to minimize.
[2021-05-17 03:57:49] [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 close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [142] Max seen :[3]
Support contains 1 out of 771 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 61 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Starting structural reductions, iteration 0 : 771/771 places, 1087/1087 transitions.
Applied a total of 0 rules in 26 ms. Remains 771 /771 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2021-05-17 03:57:49] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:57:49] [INFO ] Computed 137 place invariants in 35 ms
[2021-05-17 03:57:51] [INFO ] Implicit Places using invariants in 1331 ms returned []
[2021-05-17 03:57:51] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:57:51] [INFO ] Computed 137 place invariants in 24 ms
[2021-05-17 03:57:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 03:58:03] [INFO ] Implicit Places using invariants and state equation in 12379 ms returned []
Implicit Place search using SMT with State Equation took 13738 ms to find 0 implicit places.
[2021-05-17 03:58:03] [INFO ] Redundant transitions in 46 ms returned []
[2021-05-17 03:58:03] [INFO ] Flow matrix only has 1083 transitions (discarded 4 similar events)
// Phase 1: matrix 1083 rows 771 cols
[2021-05-17 03:58:03] [INFO ] Computed 137 place invariants in 24 ms
[2021-05-17 03:58:04] [INFO ] Dead Transitions using invariants and state equation in 1148 ms returned []
Finished structural reductions, in 1 iterations. Remains : 771/771 places, 1087/1087 transitions.
Ending property specific reduction for PolyORBNT-PT-S05J60-UpperBounds-00 in 75349 ms.
[2021-05-17 03:58:05] [INFO ] Flatten gal took : 250 ms
[2021-05-17 03:58:05] [INFO ] Applying decomposition
[2021-05-17 03:58:05] [INFO ] Flatten gal took : 67 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/graph2512672502534783779.txt, -o, /tmp/graph2512672502534783779.bin, -w, /tmp/graph2512672502534783779.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/graph2512672502534783779.bin, -l, -1, -v, -w, /tmp/graph2512672502534783779.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 03:58:05] [INFO ] Decomposing Gal with order
[2021-05-17 03:58:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 03:58:06] [INFO ] Removed a total of 1261 redundant transitions.
[2021-05-17 03:58:06] [INFO ] Flatten gal took : 1060 ms
[2021-05-17 03:58:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 79 ms.
[2021-05-17 03:58:07] [INFO ] Time to serialize gal into /tmp/UpperBounds5415816165252978330.gal : 41 ms
[2021-05-17 03:58:07] [INFO ] Time to serialize properties into /tmp/UpperBounds2343932107400083775.prop : 0 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/UpperBounds5415816165252978330.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2343932107400083775.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/UpperBounds5415816165252978330.gal -t CGAL -reachable-file /tmp/UpperBounds2343932107400083775.prop --nowitness
Loading property file /tmp/UpperBounds2343932107400083775.prop.
Detected timeout of ITS tools.
[2021-05-17 04:19:17] [INFO ] Flatten gal took : 135 ms
[2021-05-17 04:19:17] [INFO ] Time to serialize gal into /tmp/UpperBounds5436017666068374482.gal : 8 ms
[2021-05-17 04:19:17] [INFO ] Time to serialize properties into /tmp/UpperBounds15700831827596822580.prop : 0 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/UpperBounds5436017666068374482.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15700831827596822580.prop, --nowitness, --gen-order, FOLLOW], 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/UpperBounds5436017666068374482.gal -t CGAL -reachable-file /tmp/UpperBounds15700831827596822580.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds15700831827596822580.prop.
Detected timeout of ITS tools.
[2021-05-17 04:40:30] [INFO ] Flatten gal took : 658 ms
[2021-05-17 04:40:34] [INFO ] Input system was already deterministic with 1087 transitions.
[2021-05-17 04:40:34] [INFO ] Transformed 771 places.
[2021-05-17 04:40:34] [INFO ] Transformed 1087 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 04:41:05] [INFO ] Time to serialize gal into /tmp/UpperBounds6236136718950376170.gal : 19 ms
[2021-05-17 04:41:05] [INFO ] Time to serialize properties into /tmp/UpperBounds16932707491091841414.prop : 2 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/UpperBounds6236136718950376170.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds16932707491091841414.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], 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/UpperBounds6236136718950376170.gal -t CGAL -reachable-file /tmp/UpperBounds16932707491091841414.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16932707491091841414.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBNT-PT-S05J60"
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 PolyORBNT-PT-S05J60, 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 r159-oct2-162089268400467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J60.tgz
mv PolyORBNT-PT-S05J60 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;