Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.4M
-rw-r--r-- 1 mcc users 101K Apr 30 08:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 605K Apr 30 08:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 278K Apr 30 08:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 1002K Apr 30 08:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 64K May 9 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 277K May 9 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 80K May 9 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 229K May 9 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 9 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 26K May 9 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 4.7M May 10 09:33 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 FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652723250724

Running Version 202205111006
[2022-05-16 17:47:31] [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]
[2022-05-16 17:47:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:47:32] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2022-05-16 17:47:32] [INFO ] Transformed 12194 places.
[2022-05-16 17:47:32] [INFO ] Transformed 10560 transitions.
[2022-05-16 17:47:32] [INFO ] Parsed PT model containing 12194 places and 10560 transitions in 520 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 56 ms.
Reduce places removed 17 places and 0 transitions.
// Phase 1: matrix 10560 rows 12177 cols
[2022-05-16 17:47:33] [INFO ] Computed 2768 place invariants in 799 ms
Incomplete random walk after 10000 steps, including 3 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 16) seen :96
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :12
// Phase 1: matrix 10560 rows 12177 cols
[2022-05-16 17:47:34] [INFO ] Computed 2768 place invariants in 541 ms
[2022-05-16 17:47:36] [INFO ] [Real]Absence check using 149 positive place invariants in 323 ms returned sat
[2022-05-16 17:47:37] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1187 ms returned sat
[2022-05-16 17:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:47:39] [INFO ] [Real]Absence check using state equation in 2260 ms returned unknown
[2022-05-16 17:47:41] [INFO ] [Real]Absence check using 149 positive place invariants in 307 ms returned sat
[2022-05-16 17:47:42] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 827 ms returned unsat
[2022-05-16 17:47:43] [INFO ] [Real]Absence check using 149 positive place invariants in 295 ms returned sat
[2022-05-16 17:47:44] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1213 ms returned sat
[2022-05-16 17:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:47:47] [INFO ] [Real]Absence check using state equation in 2399 ms returned unknown
[2022-05-16 17:47:48] [INFO ] [Real]Absence check using 149 positive place invariants in 281 ms returned sat
[2022-05-16 17:47:49] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1218 ms returned sat
[2022-05-16 17:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:47:52] [INFO ] [Real]Absence check using state equation in 2424 ms returned unknown
[2022-05-16 17:47:53] [INFO ] [Real]Absence check using 149 positive place invariants in 285 ms returned sat
[2022-05-16 17:47:54] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1194 ms returned sat
[2022-05-16 17:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:47:57] [INFO ] [Real]Absence check using state equation in 2444 ms returned unknown
[2022-05-16 17:47:58] [INFO ] [Real]Absence check using 149 positive place invariants in 284 ms returned sat
[2022-05-16 17:47:59] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1266 ms returned sat
[2022-05-16 17:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:02] [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: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 17:48:03] [INFO ] [Real]Absence check using 149 positive place invariants in 289 ms returned sat
[2022-05-16 17:48:04] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1326 ms returned sat
[2022-05-16 17:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:07] [INFO ] [Real]Absence check using state equation in 2285 ms returned unknown
[2022-05-16 17:48:08] [INFO ] [Real]Absence check using 149 positive place invariants in 292 ms returned sat
[2022-05-16 17:48:09] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1268 ms returned sat
[2022-05-16 17:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:12] [INFO ] [Real]Absence check using state equation in 2361 ms returned unknown
[2022-05-16 17:48:13] [INFO ] [Real]Absence check using 149 positive place invariants in 291 ms returned sat
[2022-05-16 17:48:14] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1220 ms returned sat
[2022-05-16 17:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:17] [INFO ] [Real]Absence check using state equation in 2326 ms returned unknown
[2022-05-16 17:48:18] [INFO ] [Real]Absence check using 149 positive place invariants in 279 ms returned sat
[2022-05-16 17:48:19] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1219 ms returned sat
[2022-05-16 17:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:22] [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: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:901)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-16 17:48:23] [INFO ] [Real]Absence check using 149 positive place invariants in 279 ms returned sat
[2022-05-16 17:48:24] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1184 ms returned sat
[2022-05-16 17:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:27] [INFO ] [Real]Absence check using state equation in 2481 ms returned unknown
[2022-05-16 17:48:28] [INFO ] [Real]Absence check using 149 positive place invariants in 280 ms returned sat
[2022-05-16 17:48:29] [INFO ] [Real]Absence check using 149 positive and 2619 generalized place invariants in 1142 ms returned sat
[2022-05-16 17:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:32] [INFO ] [Real]Absence check using state equation in 2530 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, 2, -1, -1, -1, -1, 53, -1, -1, 3, 1, 1] Max seen :[28, 2, 22, 22, 5, 12, 1, 11, 7, 0, 0, 0]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 718 out of 12177 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 12177/12177 places, 10560/10560 transitions.
Graph (complete) has 18927 edges and 12177 vertex of which 11540 are kept as prefixes of interest. Removing 637 places using SCC suffix rule.41 ms
Discarding 637 places :
Also discarding 564 output transitions
Drop transitions removed 564 transitions
Discarding 1530 places :
Implicit places reduction removed 1530 places
Drop transitions removed 4125 transitions
Trivial Post-agglo rules discarded 4125 transitions
Performed 4125 trivial Post agglomeration. Transition count delta: 4125
Iterating post reduction 0 with 5655 rules applied. Total rules applied 5656 place count 10010 transition count 5871
Reduce places removed 4125 places and 0 transitions.
Performed 664 Post agglomeration using F-continuation condition.Transition count delta: 664
Iterating post reduction 1 with 4789 rules applied. Total rules applied 10445 place count 5885 transition count 5207
Reduce places removed 664 places and 0 transitions.
Iterating post reduction 2 with 664 rules applied. Total rules applied 11109 place count 5221 transition count 5207
Performed 408 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 408 Pre rules applied. Total rules applied 11109 place count 5221 transition count 4799
Deduced a syphon composed of 408 places in 4 ms
Ensure Unique test removed 153 places
Reduce places removed 561 places and 0 transitions.
Iterating global reduction 3 with 969 rules applied. Total rules applied 12078 place count 4660 transition count 4799
Discarding 153 places :
Implicit places reduction removed 153 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 3 with 204 rules applied. Total rules applied 12282 place count 4507 transition count 4748
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 4 with 51 rules applied. Total rules applied 12333 place count 4456 transition count 4748
Discarding 816 places :
Symmetric choice reduction at 5 with 816 rule applications. Total rules 13149 place count 3640 transition count 3932
Iterating global reduction 5 with 816 rules applied. Total rules applied 13965 place count 3640 transition count 3932
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Discarding 101 places :
Implicit places reduction removed 101 places
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 5 with 355 rules applied. Total rules applied 14320 place count 3539 transition count 3678
Reduce places removed 153 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 6 with 204 rules applied. Total rules applied 14524 place count 3386 transition count 3627
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 7 with 51 rules applied. Total rules applied 14575 place count 3335 transition count 3627
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 51 Pre rules applied. Total rules applied 14575 place count 3335 transition count 3576
Deduced a syphon composed of 51 places in 8 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 8 with 102 rules applied. Total rules applied 14677 place count 3284 transition count 3576
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 14686 place count 3275 transition count 3117
Iterating global reduction 8 with 9 rules applied. Total rules applied 14695 place count 3275 transition count 3117
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Discarding 102 places :
Implicit places reduction removed 102 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 8 with 204 rules applied. Total rules applied 14899 place count 3173 transition count 3015
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 9 with 51 rules applied. Total rules applied 14950 place count 3122 transition count 3015
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 102 Pre rules applied. Total rules applied 14950 place count 3122 transition count 2913
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 10 with 204 rules applied. Total rules applied 15154 place count 3020 transition count 2913
Performed 408 Post agglomeration using F-continuation condition.Transition count delta: 408
Deduced a syphon composed of 408 places in 1 ms
Ensure Unique test removed 306 places
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 10 with 1122 rules applied. Total rules applied 16276 place count 2306 transition count 2505
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 16277 place count 2306 transition count 2504
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 10 with 1 rules applied. Total rules applied 16278 place count 2305 transition count 2504
Free-agglomeration rule (complex) applied 408 times.
Iterating global reduction 11 with 408 rules applied. Total rules applied 16686 place count 2305 transition count 2096
Ensure Unique test removed 51 places
Reduce places removed 459 places and 0 transitions.
Iterating post reduction 11 with 459 rules applied. Total rules applied 17145 place count 1846 transition count 2096
Partial Free-agglomeration rule applied 51 times.
Drop transitions removed 51 transitions
Iterating global reduction 12 with 51 rules applied. Total rules applied 17196 place count 1846 transition count 2096
Applied a total of 17196 rules in 2361 ms. Remains 1846 /12177 variables (removed 10331) and now considering 2096/10560 (removed 8464) transitions.
Finished structural reductions, in 1 iterations. Remains : 1846/12177 places, 2096/10560 transitions.
// Phase 1: matrix 2096 rows 1846 cols
[2022-05-16 17:48:34] [INFO ] Computed 208 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 1295 resets, run finished after 16028 ms. (steps per millisecond=62 ) properties (out of 11) seen :133
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 2273 ms. (steps per millisecond=439 ) properties (out of 9) seen :59
Finished Best-First random walk after 920428 steps, including 32 resets, run visited all 9 properties in 5001 ms. (steps per millisecond=184 )
Incomplete Best-First random walk after 1000001 steps, including 32 resets, run finished after 2150 ms. (steps per millisecond=465 ) properties (out of 9) seen :92
Incomplete Best-First random walk after 1000001 steps, including 29 resets, run finished after 2093 ms. (steps per millisecond=477 ) properties (out of 9) seen :110
Incomplete Best-First random walk after 1000000 steps, including 25 resets, run finished after 3847 ms. (steps per millisecond=259 ) properties (out of 9) seen :131
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 2182 ms. (steps per millisecond=458 ) properties (out of 9) seen :105
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 2093 ms. (steps per millisecond=477 ) properties (out of 9) seen :120
Incomplete Best-First random walk after 1000001 steps, including 22 resets, run finished after 1521 ms. (steps per millisecond=657 ) properties (out of 9) seen :129
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 1491 ms. (steps per millisecond=670 ) properties (out of 9) seen :103
// Phase 1: matrix 2096 rows 1846 cols
[2022-05-16 17:49:13] [INFO ] Computed 208 place invariants in 24 ms
[2022-05-16 17:49:13] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 60 ms returned sat
[2022-05-16 17:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:13] [INFO ] [Real]Absence check using state equation in 192 ms returned unsat
[2022-05-16 17:49:14] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 78 ms returned sat
[2022-05-16 17:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:14] [INFO ] [Real]Absence check using state equation in 360 ms returned unsat
[2022-05-16 17:49:14] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 75 ms returned sat
[2022-05-16 17:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:15] [INFO ] [Real]Absence check using state equation in 353 ms returned unsat
[2022-05-16 17:49:15] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 66 ms returned sat
[2022-05-16 17:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:15] [INFO ] [Real]Absence check using state equation in 407 ms returned unsat
[2022-05-16 17:49:15] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 61 ms returned sat
[2022-05-16 17:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:16] [INFO ] [Real]Absence check using state equation in 368 ms returned unsat
[2022-05-16 17:49:16] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 60 ms returned sat
[2022-05-16 17:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:16] [INFO ] [Real]Absence check using state equation in 357 ms returned unsat
[2022-05-16 17:49:17] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 57 ms returned sat
[2022-05-16 17:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:17] [INFO ] [Real]Absence check using state equation in 356 ms returned unsat
[2022-05-16 17:49:17] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 60 ms returned sat
[2022-05-16 17:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:18] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2022-05-16 17:49:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:49:18] [INFO ] [Nat]Absence check using 0 positive and 208 generalized place invariants in 57 ms returned sat
[2022-05-16 17:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:19] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2022-05-16 17:49:19] [INFO ] Computed and/alt/rep : 1790/2606/1790 causal constraints (skipped 255 transitions) in 155 ms.
[2022-05-16 17:49:34] [INFO ] Added : 656 causal constraints over 132 iterations in 14469 ms. Result :sat
Minimization took 1172 ms.
[2022-05-16 17:49:35] [INFO ] [Real]Absence check using 0 positive and 208 generalized place invariants in 72 ms returned sat
[2022-05-16 17:49:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:35] [INFO ] [Real]Absence check using state equation in 357 ms returned unsat
Current structural bounds on expressions (after SMT) : [51, 51, 51, 51, 51, 2, 51, -1, 1] Max seen :[51, 51, 51, 51, 51, 2, 51, 33, 1]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-07 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-05 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-04 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-03 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-02 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-00 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1846 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1846/1846 places, 2096/2096 transitions.
Graph (complete) has 3882 edges and 1846 vertex of which 1691 are kept as prefixes of interest. Removing 155 places using SCC suffix rule.1 ms
Discarding 155 places :
Also discarding 102 output transitions
Drop transitions removed 102 transitions
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 362 rules applied. Total rules applied 363 place count 1691 transition count 1632
Reduce places removed 311 places and 0 transitions.
Iterating post reduction 1 with 311 rules applied. Total rules applied 674 place count 1380 transition count 1632
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 674 place count 1380 transition count 1479
Deduced a syphon composed of 153 places in 0 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 980 place count 1227 transition count 1479
Discarding 357 places :
Symmetric choice reduction at 2 with 357 rule applications. Total rules 1337 place count 870 transition count 1122
Iterating global reduction 2 with 357 rules applied. Total rules applied 1694 place count 870 transition count 1122
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 2 with 153 rules applied. Total rules applied 1847 place count 870 transition count 969
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 1898 place count 819 transition count 969
Discarding 255 places :
Symmetric choice reduction at 4 with 255 rule applications. Total rules 2153 place count 564 transition count 714
Iterating global reduction 4 with 255 rules applied. Total rules applied 2408 place count 564 transition count 714
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Discarding 51 places :
Implicit places reduction removed 51 places
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 4 with 408 rules applied. Total rules applied 2816 place count 513 transition count 357
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 5 with 102 rules applied. Total rules applied 2918 place count 411 transition count 357
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 51 places
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 6 with 153 rules applied. Total rules applied 3071 place count 309 transition count 306
Reduce places removed 51 places and 51 transitions.
Iterating global reduction 6 with 51 rules applied. Total rules applied 3122 place count 258 transition count 255
Applied a total of 3122 rules in 184 ms. Remains 258 /1846 variables (removed 1588) and now considering 255/2096 (removed 1841) transitions.
Finished structural reductions, in 1 iterations. Remains : 258/1846 places, 255/2096 transitions.
// Phase 1: matrix 255 rows 258 cols
[2022-05-16 17:49:36] [INFO ] Computed 53 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6488 resets, run finished after 8557 ms. (steps per millisecond=116 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 114 resets, run finished after 1436 ms. (steps per millisecond=696 ) properties (out of 1) seen :39
// Phase 1: matrix 255 rows 258 cols
[2022-05-16 17:49:46] [INFO ] Computed 53 place invariants in 4 ms
[2022-05-16 17:49:46] [INFO ] [Real]Absence check using 0 positive and 53 generalized place invariants in 7 ms returned sat
[2022-05-16 17:49:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:49:46] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
Current structural bounds on expressions (after SMT) : [51] Max seen :[51]
FORMULA FamilyReunion-PT-L00050M0005C002P002G001-UpperBounds-11 51 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 134749 ms.

BK_STOP 1652723386674

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FamilyReunion-PT-L00050M0005C002P002G001"
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 FamilyReunion-PT-L00050M0005C002P002G001, 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 r078-tall-165260110700733"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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