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.r287-smll-167863553800077.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 gold2022
Input is Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 29K Feb 25 22:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Feb 25 22:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 93K Feb 25 22:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 439K Feb 25 22:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 283K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 143K Mar 5 18:23 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678922352824

Running Version 202205111006
[2023-03-15 23:19:15] [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]
[2023-03-15 23:19:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:19:15] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2023-03-15 23:19:15] [INFO ] Transformed 244 places.
[2023-03-15 23:19:15] [INFO ] Transformed 332 transitions.
[2023-03-15 23:19:15] [INFO ] Found NUPN structural information;
[2023-03-15 23:19:15] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2023-03-15 23:19:15] [INFO ] Parsed PT model containing 244 places and 332 transitions in 482 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
FORMULA Peterson-PT-3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 308 out of 332 initially.
// Phase 1: matrix 308 rows 244 cols
[2023-03-15 23:19:15] [INFO ] Computed 15 place invariants in 35 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :23
FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) 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 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :11
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 :19
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 :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :19
[2023-03-15 23:19:16] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-15 23:19:16] [INFO ] Computed 15 place invariants in 6 ms
[2023-03-15 23:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 20 ms returned unsat
[2023-03-15 23:19:16] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned unsat
[2023-03-15 23:19:17] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned unsat
[2023-03-15 23:19:17] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-15 23:19:17] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-15 23:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:17] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-15 23:19:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-03-15 23:19:17] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-15 23:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:17] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2023-03-15 23:19:17] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 23:19:17] [INFO ] [Nat]Added 57 Read/Feed constraints in 23 ms returned sat
[2023-03-15 23:19:18] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 5 ms to minimize.
[2023-03-15 23:19:18] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 2 ms to minimize.
[2023-03-15 23:19:18] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 2 ms to minimize.
[2023-03-15 23:19:18] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2023-03-15 23:19:18] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2023-03-15 23:19:19] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 0 ms to minimize.
[2023-03-15 23:19:19] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2023-03-15 23:19:19] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2023-03-15 23:19:19] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 1 ms to minimize.
[2023-03-15 23:19:19] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 1 ms to minimize.
[2023-03-15 23:19:19] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 1 ms to minimize.
[2023-03-15 23:19:20] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 1 ms to minimize.
[2023-03-15 23:19:20] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 1 ms to minimize.
[2023-03-15 23:19:20] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 1 ms to minimize.
[2023-03-15 23:19:21] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2023-03-15 23:19:21] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 1 ms to minimize.
[2023-03-15 23:19:21] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 1 ms to minimize.
[2023-03-15 23:19:21] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 1 ms to minimize.
[2023-03-15 23:19:21] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 1 ms to minimize.
[2023-03-15 23:19:22] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 1 ms to minimize.
[2023-03-15 23:19:22] [INFO ] Deduced a trap composed of 74 places in 142 ms of which 1 ms to minimize.
[2023-03-15 23:19:22] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 1 ms to minimize.
[2023-03-15 23:19: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: Stream close... while checking expression at index 3
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
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)
[2023-03-15 23:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned unsat
[2023-03-15 23:19:22] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-15 23:19:22] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:19:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:23] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2023-03-15 23:19:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 23:19:23] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-15 23:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:23] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-15 23:19:23] [INFO ] [Nat]Added 57 Read/Feed constraints in 42 ms returned sat
[2023-03-15 23:19:23] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 0 ms to minimize.
[2023-03-15 23:19:23] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2023-03-15 23:19:23] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 2 ms to minimize.
[2023-03-15 23:19:24] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-15 23:19:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 759 ms
[2023-03-15 23:19:24] [INFO ] [Real]Absence check using 11 positive place invariants in 17 ms returned sat
[2023-03-15 23:19:24] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:19:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:24] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2023-03-15 23:19:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:24] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2023-03-15 23:19:24] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:19:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:24] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2023-03-15 23:19:24] [INFO ] [Nat]Added 57 Read/Feed constraints in 18 ms returned sat
[2023-03-15 23:19:24] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 44 ms.
[2023-03-15 23:19:26] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2023-03-15 23:19:26] [INFO ] Deduced a trap composed of 12 places in 179 ms of which 5 ms to minimize.
[2023-03-15 23:19:26] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2023-03-15 23:19:26] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 2 ms to minimize.
[2023-03-15 23:19:26] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 1 ms to minimize.
[2023-03-15 23:19:27] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2023-03-15 23:19:27] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2023-03-15 23:19:27] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 2 ms to minimize.
[2023-03-15 23:19:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1727 ms
[2023-03-15 23:19:28] [INFO ] Added : 163 causal constraints over 34 iterations in 3166 ms. Result :sat
Minimization took 146 ms.
[2023-03-15 23:19:28] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2023-03-15 23:19:28] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:28] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2023-03-15 23:19:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 15 ms returned sat
[2023-03-15 23:19:28] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:28] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-15 23:19:28] [INFO ] [Nat]Added 57 Read/Feed constraints in 25 ms returned sat
[2023-03-15 23:19:28] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 40 ms.
[2023-03-15 23:19:29] [INFO ] Added : 10 causal constraints over 2 iterations in 167 ms. Result :sat
Minimization took 58 ms.
[2023-03-15 23:19:29] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2023-03-15 23:19:29] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:29] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2023-03-15 23:19:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2023-03-15 23:19:29] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:29] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-15 23:19:29] [INFO ] [Nat]Added 57 Read/Feed constraints in 17 ms returned sat
[2023-03-15 23:19:29] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 37 ms.
[2023-03-15 23:19:29] [INFO ] Added : 12 causal constraints over 3 iterations in 153 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 4, 3, 1, 1, 1] Max seen :[4, 4, 4, 1, 4, 3, 0, 0, 0]
FORMULA Peterson-PT-3-UpperBounds-07 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 244 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 93 place count 244 transition count 239
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 187 place count 151 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 188 place count 150 transition count 238
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 188 place count 150 transition count 194
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 276 place count 106 transition count 194
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 300 place count 94 transition count 182
Applied a total of 300 rules in 79 ms. Remains 94 /244 variables (removed 150) and now considering 182/332 (removed 150) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/244 places, 182/332 transitions.
Normalized transition count is 158 out of 182 initially.
// Phase 1: matrix 158 rows 94 cols
[2023-03-15 23:19:30] [INFO ] Computed 15 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1818 ms. (steps per millisecond=550 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 2) seen :1
[2023-03-15 23:19:33] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 94 cols
[2023-03-15 23:19:33] [INFO ] Computed 15 place invariants in 3 ms
[2023-03-15 23:19:33] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 23:19:33] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:33] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-15 23:19:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 23:19:33] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:19:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:33] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-15 23:19:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-15 23:19:33] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2023-03-15 23:19:33] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2023-03-15 23:19:33] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-15 23:19:33] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-15 23:19:33] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2023-03-15 23:19:33] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2023-03-15 23:19:33] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 0 ms to minimize.
[2023-03-15 23:19:33] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2023-03-15 23:19:34] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 13 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2023-03-15 23:19:35] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2023-03-15 23:19:36] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-15 23:19:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 31 trap constraints in 2768 ms
[2023-03-15 23:19:36] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 23:19:36] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:36] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-15 23:19:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-15 23:19:36] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-15 23:19:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:36] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-15 23:19:36] [INFO ] [Nat]Added 57 Read/Feed constraints in 24 ms returned sat
[2023-03-15 23:19:36] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 20 ms.
[2023-03-15 23:19:36] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-15 23:19:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-15 23:19:36] [INFO ] Added : 33 causal constraints over 7 iterations in 283 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[1, 0]
FORMULA Peterson-PT-3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 94 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 94/94 places, 181/181 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 93 transition count 179
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 1 place count 93 transition count 175
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 9 place count 89 transition count 175
Applied a total of 9 rules in 21 ms. Remains 89 /94 variables (removed 5) and now considering 175/181 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/94 places, 175/181 transitions.
Normalized transition count is 151 out of 175 initially.
// Phase 1: matrix 151 rows 89 cols
[2023-03-15 23:19:36] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1459 ms. (steps per millisecond=685 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 1) seen :0
[2023-03-15 23:19:39] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 89 cols
[2023-03-15 23:19:39] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 23:19:39] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 23:19:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:19:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:39] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-15 23:19:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 23:19:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-15 23:19:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:39] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-15 23:19:39] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 23:19:39] [INFO ] [Nat]Added 56 Read/Feed constraints in 12 ms returned sat
[2023-03-15 23:19:39] [INFO ] Computed and/alt/rep : 127/335/127 causal constraints (skipped 20 transitions) in 23 ms.
[2023-03-15 23:19:39] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-15 23:19:39] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
[2023-03-15 23:19:39] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-15 23:19:40] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-15 23:19:40] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 1 ms to minimize.
[2023-03-15 23:19:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2023-03-15 23:19:40] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 554 ms
[2023-03-15 23:19:40] [INFO ] Added : 75 causal constraints over 15 iterations in 921 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 89/89 places, 175/175 transitions.
Applied a total of 0 rules in 13 ms. Remains 89 /89 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 89/89 places, 175/175 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 89/89 places, 175/175 transitions.
Applied a total of 0 rules in 13 ms. Remains 89 /89 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2023-03-15 23:19:40] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 89 cols
[2023-03-15 23:19:40] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 23:19:40] [INFO ] Implicit Places using invariants in 212 ms returned [82, 83, 84, 85]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 225 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 85/89 places, 175/175 transitions.
Applied a total of 0 rules in 13 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 85/89 places, 175/175 transitions.
Normalized transition count is 151 out of 175 initially.
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:40] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=1980 ) properties (out of 1) seen :0
[2023-03-15 23:19:42] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:42] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 23:19:42] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 23:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:42] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-15 23:19:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 23:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:42] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-15 23:19:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 23:19:42] [INFO ] [Nat]Added 56 Read/Feed constraints in 11 ms returned sat
[2023-03-15 23:19:42] [INFO ] Computed and/alt/rep : 127/335/127 causal constraints (skipped 20 transitions) in 23 ms.
[2023-03-15 23:19:43] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-15 23:19:43] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2023-03-15 23:19:43] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2023-03-15 23:19:43] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-15 23:19:43] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2023-03-15 23:19:43] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-15 23:19:43] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2023-03-15 23:19:43] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2023-03-15 23:19:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 658 ms
[2023-03-15 23:19:43] [INFO ] Added : 59 causal constraints over 12 iterations in 939 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 12 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 175/175 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 21 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2023-03-15 23:19:43] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:43] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 23:19:44] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-15 23:19:44] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:44] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-15 23:19:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 23:19:44] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2023-03-15 23:19:44] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 23:19:44] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:44] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 23:19:44] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 175/175 transitions.
Starting property specific reduction for Peterson-PT-3-UpperBounds-08
Normalized transition count is 151 out of 175 initially.
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:44] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 23:19:44] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:44] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 23:19:44] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 23:19:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:44] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-15 23:19:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 23:19:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:44] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-15 23:19:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 23:19:44] [INFO ] [Nat]Added 56 Read/Feed constraints in 12 ms returned sat
[2023-03-15 23:19:44] [INFO ] Computed and/alt/rep : 127/335/127 causal constraints (skipped 20 transitions) in 21 ms.
[2023-03-15 23:19:45] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2023-03-15 23:19:45] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-15 23:19:45] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2023-03-15 23:19:45] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
[2023-03-15 23:19:45] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2023-03-15 23:19:45] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2023-03-15 23:19:45] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-03-15 23:19:45] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-15 23:19:45] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 664 ms
[2023-03-15 23:19:45] [INFO ] Added : 59 causal constraints over 12 iterations in 946 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 12 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 175/175 transitions.
Normalized transition count is 151 out of 175 initially.
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:45] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1501 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 531 ms. (steps per millisecond=1883 ) properties (out of 1) seen :0
[2023-03-15 23:19:48] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:48] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-15 23:19:48] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 23:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:48] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-15 23:19:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:19:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-15 23:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:19:48] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-15 23:19:48] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 23:19:48] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2023-03-15 23:19:48] [INFO ] Computed and/alt/rep : 127/335/127 causal constraints (skipped 20 transitions) in 17 ms.
[2023-03-15 23:19:48] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2023-03-15 23:19:48] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-15 23:19:48] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2023-03-15 23:19:48] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-15 23:19:48] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2023-03-15 23:19:48] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-15 23:19:49] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2023-03-15 23:19:49] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-15 23:19:49] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 620 ms
[2023-03-15 23:19:49] [INFO ] Added : 59 causal constraints over 12 iterations in 894 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 12 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 175/175 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 11 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2023-03-15 23:19:49] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:49] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 23:19:49] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-15 23:19:49] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:49] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 23:19:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-15 23:19:49] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-15 23:19:49] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 23:19:49] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2023-03-15 23:19:49] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-15 23:19:49] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 175/175 transitions.
Ending property specific reduction for Peterson-PT-3-UpperBounds-08 in 5385 ms.
[2023-03-15 23:19:50] [INFO ] Flatten gal took : 101 ms
[2023-03-15 23:19:50] [INFO ] Applying decomposition
[2023-03-15 23:19:50] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15245471983024450489.txt' '-o' '/tmp/graph15245471983024450489.bin' '-w' '/tmp/graph15245471983024450489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15245471983024450489.bin' '-l' '-1' '-v' '-w' '/tmp/graph15245471983024450489.weights' '-q' '0' '-e' '0.001'
[2023-03-15 23:19:50] [INFO ] Decomposing Gal with order
[2023-03-15 23:19:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 23:19:50] [INFO ] Removed a total of 170 redundant transitions.
[2023-03-15 23:19:50] [INFO ] Flatten gal took : 110 ms
[2023-03-15 23:19:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 18 ms.
[2023-03-15 23:19:50] [INFO ] Time to serialize gal into /tmp/UpperBounds1436129150387355675.gal : 15 ms
[2023-03-15 23:19:50] [INFO ] Time to serialize properties into /tmp/UpperBounds13105167399831937712.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1436129150387355675.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13105167399831937712.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds13105167399831937712.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,53108,1.24341,24540,1067,246,35336,1158,439,57795,121,7498,0
Total reachable state count : 53108

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-3-UpperBounds-08 :0 <= i3.u6.BeginLoop_2_2_3 <= 1
FORMULA Peterson-PT-3-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-3-UpperBounds-08,0,1.26331,24540,1,0,35336,1158,536,57795,137,7498,327
Total runtime 36997 ms.

BK_STOP 1678922392506

--------------------
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="Peterson-PT-3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is Peterson-PT-3, 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 r287-smll-167863553800077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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