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.r511-tall-167912735600062.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 Szymanski-PT-b12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r511-tall-167912735600062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.7K Feb 26 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 17:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 17:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Feb 26 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b12-UpperBounds-00
FORMULA_NAME Szymanski-PT-b12-UpperBounds-01
FORMULA_NAME Szymanski-PT-b12-UpperBounds-02
FORMULA_NAME Szymanski-PT-b12-UpperBounds-03
FORMULA_NAME Szymanski-PT-b12-UpperBounds-04
FORMULA_NAME Szymanski-PT-b12-UpperBounds-05
FORMULA_NAME Szymanski-PT-b12-UpperBounds-06
FORMULA_NAME Szymanski-PT-b12-UpperBounds-07
FORMULA_NAME Szymanski-PT-b12-UpperBounds-08
FORMULA_NAME Szymanski-PT-b12-UpperBounds-09
FORMULA_NAME Szymanski-PT-b12-UpperBounds-10
FORMULA_NAME Szymanski-PT-b12-UpperBounds-11
FORMULA_NAME Szymanski-PT-b12-UpperBounds-12
FORMULA_NAME Szymanski-PT-b12-UpperBounds-13
FORMULA_NAME Szymanski-PT-b12-UpperBounds-14
FORMULA_NAME Szymanski-PT-b12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679323184018

Running Version 202205111006
[2023-03-20 14:39:45] [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-20 14:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 14:39:45] [INFO ] Load time of PNML (sax parser for PT used): 342 ms
[2023-03-20 14:39:45] [INFO ] Transformed 568 places.
[2023-03-20 14:39:45] [INFO ] Transformed 8320 transitions.
[2023-03-20 14:39:45] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 486 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 260 places in 21 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2733 out of 8064 initially.
// Phase 1: matrix 2733 rows 308 cols
[2023-03-20 14:39:45] [INFO ] Computed 3 place invariants in 64 ms
Incomplete random walk after 10003 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :3
FORMULA Szymanski-PT-b12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-b12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :1
FORMULA Szymanski-PT-b12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :1
FORMULA Szymanski-PT-b12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :1
FORMULA Szymanski-PT-b12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-20 14:39:46] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2023-03-20 14:39:46] [INFO ] Computed 3 place invariants in 31 ms
[2023-03-20 14:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-20 14:39:46] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-20 14:39:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:39:46] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2023-03-20 14:39:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:39:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 14:39:47] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 14:39:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:39:48] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2023-03-20 14:39:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 14:39:48] [INFO ] [Nat]Added 147 Read/Feed constraints in 539 ms returned sat
[2023-03-20 14:39:49] [INFO ] Deduced a trap composed of 130 places in 616 ms of which 4 ms to minimize.
[2023-03-20 14:39:49] [INFO ] Deduced a trap composed of 46 places in 563 ms of which 2 ms to minimize.
[2023-03-20 14:39:50] [INFO ] Deduced a trap composed of 130 places in 686 ms of which 1 ms to minimize.
[2023-03-20 14:39:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2177 ms
[2023-03-20 14:39:51] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 949 ms.
[2023-03-20 14:39:51] [INFO ] Added : 0 causal constraints over 0 iterations in 1168 ms. Result :unknown
[2023-03-20 14:39:52] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-20 14:39:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 14:39:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:39:52] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-20 14:39:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:39:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-20 14:39:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 14:39:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:39:53] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2023-03-20 14:39:53] [INFO ] [Nat]Added 147 Read/Feed constraints in 694 ms returned sat
[2023-03-20 14:39:54] [INFO ] Deduced a trap composed of 88 places in 573 ms of which 1 ms to minimize.
[2023-03-20 14:39:54] [INFO ] Deduced a trap composed of 70 places in 556 ms of which 0 ms to minimize.
[2023-03-20 14:39:55] [INFO ] Deduced a trap composed of 75 places in 539 ms of which 2 ms to minimize.
[2023-03-20 14:39:56] [INFO ] Deduced a trap composed of 86 places in 545 ms of which 0 ms to minimize.
[2023-03-20 14:39:56] [INFO ] Deduced a trap composed of 139 places in 543 ms of which 1 ms to minimize.
[2023-03-20 14:39:57] [INFO ] Deduced a trap composed of 144 places in 556 ms of which 0 ms to minimize.
[2023-03-20 14:39:57] [INFO ] Deduced a trap composed of 137 places in 500 ms of which 0 ms to minimize.
[2023-03-20 14:39:57] [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 1
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-20 14:39:58] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-20 14:39:58] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 14:39:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:39:58] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2023-03-20 14:39:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:39:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-20 14:39:58] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 14:39:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:39:59] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-20 14:39:59] [INFO ] [Nat]Added 147 Read/Feed constraints in 617 ms returned sat
[2023-03-20 14:40:00] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2722 transitions) in 405 ms.
[2023-03-20 14:40:00] [INFO ] Added : 0 causal constraints over 0 iterations in 569 ms. Result :sat
Minimization took 530 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 466 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/308 places, 7808/8064 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 14:40:01] [INFO ] Computed 3 place invariants in 35 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties (out of 3) seen :1
FORMULA Szymanski-PT-b12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 750 ms. (steps per millisecond=1333 ) properties (out of 2) seen :0
[2023-03-20 14:40:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 14:40:03] [INFO ] Computed 3 place invariants in 26 ms
[2023-03-20 14:40:04] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 14:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:40:04] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-20 14:40:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:40:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 14:40:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:40:04] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2023-03-20 14:40:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 14:40:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-20 14:40:08] [INFO ] [Nat]Added 147 Read/Feed constraints in 3289 ms returned sat
[2023-03-20 14:40:08] [INFO ] Deduced a trap composed of 102 places in 457 ms of which 1 ms to minimize.
[2023-03-20 14:40:09] [INFO ] Deduced a trap composed of 129 places in 458 ms of which 1 ms to minimize.
[2023-03-20 14:40:09] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 1 ms to minimize.
[2023-03-20 14:40:10] [INFO ] Deduced a trap composed of 129 places in 473 ms of which 1 ms to minimize.
[2023-03-20 14:40:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2238 ms
[2023-03-20 14:40:10] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 495 ms.
[2023-03-20 14:40:11] [INFO ] Added : 0 causal constraints over 0 iterations in 659 ms. Result :sat
Minimization took 910 ms.
[2023-03-20 14:40:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 14:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:40:12] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2023-03-20 14:40:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:40:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 14:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:40:12] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2023-03-20 14:40:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 301 ms returned sat
[2023-03-20 14:40:13] [INFO ] Deduced a trap composed of 78 places in 496 ms of which 1 ms to minimize.
[2023-03-20 14:40:14] [INFO ] Deduced a trap composed of 129 places in 483 ms of which 1 ms to minimize.
[2023-03-20 14:40:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1156 ms
[2023-03-20 14:40:14] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 328 ms.
[2023-03-20 14:40:14] [INFO ] Added : 0 causal constraints over 0 iterations in 497 ms. Result :sat
Minimization took 811 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA Szymanski-PT-b12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 237 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 14:40:16] [INFO ] Computed 3 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 1) seen :0
[2023-03-20 14:40:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 14:40:17] [INFO ] Computed 3 place invariants in 21 ms
[2023-03-20 14:40:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-20 14:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 14:40:18] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-20 14:40:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 14:40:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-20 14:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 14:40:18] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-20 14:40:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 14:40:21] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-20 14:40:21] [INFO ] [Nat]Added 147 Read/Feed constraints in 3069 ms returned sat
[2023-03-20 14:40:22] [INFO ] Deduced a trap composed of 102 places in 477 ms of which 0 ms to minimize.
[2023-03-20 14:40:22] [INFO ] Deduced a trap composed of 129 places in 473 ms of which 1 ms to minimize.
[2023-03-20 14:40:23] [INFO ] Deduced a trap composed of 75 places in 495 ms of which 0 ms to minimize.
[2023-03-20 14:40:24] [INFO ] Deduced a trap composed of 129 places in 494 ms of which 0 ms to minimize.
[2023-03-20 14:40:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2433 ms
[2023-03-20 14:40:24] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 341 ms.
[2023-03-20 14:40:24] [INFO ] Added : 0 causal constraints over 0 iterations in 497 ms. Result :sat
Minimization took 964 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 294 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-20 14:40:26] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 14:40:26] [INFO ] Computed 3 place invariants in 18 ms
[2023-03-20 14:40:26] [INFO ] Implicit Places using invariants in 543 ms returned []
[2023-03-20 14:40:26] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 14:40:26] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-20 14:40:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-20 14:40:28] [INFO ] Implicit Places using invariants and state equation in 1930 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
[2023-03-20 14:40:29] [INFO ] Redundant transitions in 888 ms returned []
[2023-03-20 14:40:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 14:40:29] [INFO ] Computed 3 place invariants in 27 ms
[2023-03-20 14:40:31] [INFO ] Dead Transitions using invariants and state equation in 2066 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7808/7808 transitions.
Starting property specific reduction for Szymanski-PT-b12-UpperBounds-05
Normalized transition count is 2604 out of 7808 initially.
// Phase 1: matrix 2604 rows 305 cols
[2023-03-20 14:40:31] [INFO ] Computed 3 place invariants in 19 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
FORMULA Szymanski-PT-b12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Ending property specific reduction for Szymanski-PT-b12-UpperBounds-05 in 62 ms.
[2023-03-20 14:40:32] [INFO ] Flatten gal took : 456 ms
[2023-03-20 14:40:32] [INFO ] Applying decomposition
[2023-03-20 14:40:33] [INFO ] Flatten gal took : 281 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/graph16428242042767589761.txt' '-o' '/tmp/graph16428242042767589761.bin' '-w' '/tmp/graph16428242042767589761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16428242042767589761.bin' '-l' '-1' '-v' '-w' '/tmp/graph16428242042767589761.weights' '-q' '0' '-e' '0.001'
[2023-03-20 14:40:34] [INFO ] Decomposing Gal with order
[2023-03-20 14:40:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-20 14:40:35] [INFO ] Removed a total of 17583 redundant transitions.
[2023-03-20 14:40:35] [INFO ] Flatten gal took : 1037 ms
[2023-03-20 14:40:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1082 labels/synchronizations in 256 ms.
[2023-03-20 14:40:35] [INFO ] Time to serialize gal into /tmp/UpperBounds2853751740358082690.gal : 34 ms
[2023-03-20 14:40:35] [INFO ] Time to serialize properties into /tmp/UpperBounds1198083742943785658.prop : 14 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/UpperBounds2853751740358082690.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1198083742943785658.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...274
Loading property file /tmp/UpperBounds1198083742943785658.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
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,7,0.910692,22700,77,102,133,428,8301,19,589,468,0
Total reachable state count : 7

Total runtime 51524 ms.

BK_STOP 1679323236834

--------------------
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="Szymanski-PT-b12"
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 Szymanski-PT-b12, 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 r511-tall-167912735600062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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