Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 23K Feb 26 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 11:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 162K Feb 26 11:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Feb 26 12:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 316K Feb 26 12:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 26 12:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 180K Feb 26 12:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 24 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 552K Mar 5 18:22 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-L00010M0001C001P001G001-UpperBounds-00
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-01
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-02
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-03
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-04
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-05
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-06
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-07
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-08
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-09
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-10
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-11
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-12
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-13
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-14
FORMULA_NAME FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678474299831

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FamilyReunion-PT-L00010M0001C001P001G001
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 18:51:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 18:51:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 18:51:41] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2023-03-10 18:51:41] [INFO ] Transformed 1475 places.
[2023-03-10 18:51:41] [INFO ] Transformed 1234 transitions.
[2023-03-10 18:51:41] [INFO ] Parsed PT model containing 1475 places and 1234 transitions and 3799 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduce places removed 10 places and 0 transitions.
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 1234 rows 1465 cols
[2023-03-10 18:51:41] [INFO ] Computed 332 place invariants in 93 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 14) seen :51
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :38
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :26
[2023-03-10 18:51:42] [INFO ] Invariant cache hit.
[2023-03-10 18:51:42] [INFO ] [Real]Absence check using 30 positive place invariants in 30 ms returned sat
[2023-03-10 18:51:42] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 171 ms returned unsat
[2023-03-10 18:51:42] [INFO ] [Real]Absence check using 30 positive place invariants in 50 ms returned sat
[2023-03-10 18:51:43] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 100 ms returned unsat
[2023-03-10 18:51:43] [INFO ] [Real]Absence check using 30 positive place invariants in 61 ms returned sat
[2023-03-10 18:51:43] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 96 ms returned unsat
[2023-03-10 18:51:43] [INFO ] [Real]Absence check using 30 positive place invariants in 27 ms returned sat
[2023-03-10 18:51:43] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 88 ms returned unsat
[2023-03-10 18:51:43] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2023-03-10 18:51:43] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 5 ms returned unsat
[2023-03-10 18:51:43] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2023-03-10 18:51:44] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 5 ms returned unsat
[2023-03-10 18:51:44] [INFO ] [Real]Absence check using 30 positive place invariants in 23 ms returned sat
[2023-03-10 18:51:44] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 100 ms returned unsat
[2023-03-10 18:51:44] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2023-03-10 18:51:44] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 81 ms returned unsat
[2023-03-10 18:51:44] [INFO ] [Real]Absence check using 30 positive place invariants in 19 ms returned sat
[2023-03-10 18:51:44] [INFO ] [Real]Absence check using 30 positive and 302 generalized place invariants in 90 ms returned sat
[2023-03-10 18:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:51:46] [INFO ] [Real]Absence check using state equation in 1311 ms returned sat
[2023-03-10 18:51:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:51:46] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2023-03-10 18:51:46] [INFO ] [Nat]Absence check using 30 positive and 302 generalized place invariants in 71 ms returned sat
[2023-03-10 18:51:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:51:46] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2023-03-10 18:51:47] [INFO ] Computed and/alt/rep : 1133/1650/1133 causal constraints (skipped 90 transitions) in 61 ms.
[2023-03-10 18:51:51] [INFO ] Deduced a trap composed of 31 places in 543 ms of which 3 ms to minimize.
[2023-03-10 18:51:51] [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 8
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
Current structural bounds on expressions (after SMT) : [11, 11, 2, 11, 11, 11, 2, 11, 67311] Max seen :[11, 11, 2, 11, 11, 11, 2, 11, 4]
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-07 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-05 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-04 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-03 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-01 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 1465 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1465/1465 places, 1234/1234 transitions.
Graph (complete) has 2215 edges and 1465 vertex of which 1171 are kept as prefixes of interest. Removing 294 places using SCC suffix rule.3 ms
Discarding 294 places :
Also discarding 255 output transitions
Drop transitions removed 255 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 132 places :
Implicit places reduction removed 132 places
Drop transitions removed 451 transitions
Trivial Post-agglo rules discarded 451 transitions
Performed 451 trivial Post agglomeration. Transition count delta: 451
Iterating post reduction 0 with 594 rules applied. Total rules applied 595 place count 1039 transition count 517
Reduce places removed 451 places and 0 transitions.
Iterating post reduction 1 with 451 rules applied. Total rules applied 1046 place count 588 transition count 517
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 1046 place count 588 transition count 407
Deduced a syphon composed of 110 places in 0 ms
Ensure Unique test removed 55 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 2 with 275 rules applied. Total rules applied 1321 place count 423 transition count 407
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 2 with 33 rules applied. Total rules applied 1354 place count 423 transition count 374
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 3 with 33 rules applied. Total rules applied 1387 place count 390 transition count 374
Discarding 76 places :
Symmetric choice reduction at 4 with 76 rule applications. Total rules 1463 place count 314 transition count 298
Iterating global reduction 4 with 76 rules applied. Total rules applied 1539 place count 314 transition count 298
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 4 with 110 rules applied. Total rules applied 1649 place count 292 transition count 210
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 5 with 77 rules applied. Total rules applied 1726 place count 215 transition count 210
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1726 place count 215 transition count 209
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1728 place count 214 transition count 209
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 1730 place count 212 transition count 187
Iterating global reduction 6 with 2 rules applied. Total rules applied 1732 place count 212 transition count 187
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 33 places :
Implicit places reduction removed 33 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 6 with 77 rules applied. Total rules applied 1809 place count 179 transition count 143
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 7 with 33 rules applied. Total rules applied 1842 place count 146 transition count 143
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 1842 place count 146 transition count 121
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1886 place count 124 transition count 121
Discarding 11 places :
Symmetric choice reduction at 8 with 11 rule applications. Total rules 1897 place count 113 transition count 110
Iterating global reduction 8 with 11 rules applied. Total rules applied 1908 place count 113 transition count 110
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 8 with 44 rules applied. Total rules applied 1952 place count 102 transition count 77
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1974 place count 80 transition count 77
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1996 place count 69 transition count 66
Reduce places removed 11 places and 11 transitions.
Iterating global reduction 10 with 11 rules applied. Total rules applied 2007 place count 58 transition count 55
Applied a total of 2007 rules in 109 ms. Remains 58 /1465 variables (removed 1407) and now considering 55/1234 (removed 1179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 58/1465 places, 55/1234 transitions.
// Phase 1: matrix 55 rows 58 cols
[2023-03-10 18:51:51] [INFO ] Computed 13 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 29425 resets, run finished after 1987 ms. (steps per millisecond=503 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2305 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties (out of 1) seen :10
[2023-03-10 18:51:54] [INFO ] Invariant cache hit.
[2023-03-10 18:51:54] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-10 18:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:51:54] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-10 18:51:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:51:54] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 2 ms returned sat
[2023-03-10 18:51:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:51:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-10 18:51:54] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 33 transitions) in 4 ms.
[2023-03-10 18:51:54] [INFO ] Added : 11 causal constraints over 3 iterations in 19 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [67311] Max seen :[10]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 55/55 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 58/58 places, 55/55 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 55/55 transitions.
Applied a total of 0 rules in 2 ms. Remains 58 /58 variables (removed 0) and now considering 55/55 (removed 0) transitions.
[2023-03-10 18:51:54] [INFO ] Invariant cache hit.
[2023-03-10 18:51:54] [INFO ] Implicit Places using invariants in 59 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 45, 46]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 62 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 45/58 places, 55/55 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 45 transition count 44
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 34 transition count 44
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 24 transition count 34
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 24 transition count 34
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 14 transition count 24
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 14 transition count 24
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 72 place count 4 transition count 4
Iterating global reduction 0 with 10 rules applied. Total rules applied 82 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 84 place count 3 transition count 3
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 3 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 2 transition count 3
Applied a total of 86 rules in 6 ms. Remains 2 /45 variables (removed 43) and now considering 3/55 (removed 52) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-10 18:51:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 18:51:54] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 18:51:54] [INFO ] Invariant cache hit.
[2023-03-10 18:51:54] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/58 places, 3/55 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 107 ms. Remains : 2/58 places, 3/55 transitions.
Successfully produced net in file /tmp/petri1000_526902392912822590.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 18:51:54] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000003 steps, including 39999 resets, run finished after 247 ms. (steps per millisecond=4048 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 22727 resets, run finished after 146 ms. (steps per millisecond=6849 ) properties (out of 1) seen :11
[2023-03-10 18:51:55] [INFO ] Invariant cache hit.
[2023-03-10 18:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:51:55] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [11] Max seen :[11]
FORMULA FamilyReunion-PT-L00010M0001C001P001G001-UpperBounds-12 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 13470 ms.
ITS solved all properties within timeout

BK_STOP 1678474315918

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-L00010M0001C001P001G001"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is FamilyReunion-PT-L00010M0001C001P001G001, 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 r167-tall-167838853000397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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