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.r235-tall-167856422300791.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 smartxred
Input is MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422300791
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 13K Feb 26 02:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 02:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 02:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 02:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 02:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Feb 26 02:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 02:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.7M 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678697134062

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=smartxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C07
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 08:45:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 08:45:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 08:45:35] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2023-03-13 08:45:35] [INFO ] Transformed 6222 places.
[2023-03-13 08:45:35] [INFO ] Transformed 8685 transitions.
[2023-03-13 08:45:36] [INFO ] Parsed PT model containing 6222 places and 8685 transitions and 32582 arcs in 556 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 137 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 16) seen :7
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 08:45:37] [INFO ] Flow matrix only has 8413 transitions (discarded 272 similar events)
// Phase 1: matrix 8413 rows 6222 cols
[2023-03-13 08:45:37] [INFO ] Computed 611 place invariants in 389 ms
[2023-03-13 08:45:39] [INFO ] [Real]Absence check using 52 positive place invariants in 33 ms returned sat
[2023-03-13 08:45:39] [INFO ] [Real]Absence check using 52 positive and 559 generalized place invariants in 268 ms returned sat
[2023-03-13 08:45:40] [INFO ] After 1860ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:5
[2023-03-13 08:45:40] [INFO ] [Nat]Absence check using 52 positive place invariants in 23 ms returned sat
[2023-03-13 08:45:41] [INFO ] [Nat]Absence check using 52 positive and 559 generalized place invariants in 282 ms returned sat
[2023-03-13 08:45:59] [INFO ] After 18022ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-13 08:45:59] [INFO ] State equation strengthened by 2450 read => feed constraints.
[2023-03-13 08:46:05] [INFO ] After 5430ms SMT Verify possible using 2450 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2023-03-13 08:46:05] [INFO ] After 5431ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-13 08:46:05] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 149 out of 6222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6222/6222 places, 8685/8685 transitions.
Graph (complete) has 19247 edges and 6222 vertex of which 6188 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.21 ms
Discarding 34 places :
Also discarding 0 output transitions
Drop transitions removed 1763 transitions
Trivial Post-agglo rules discarded 1763 transitions
Performed 1763 trivial Post agglomeration. Transition count delta: 1763
Iterating post reduction 0 with 1763 rules applied. Total rules applied 1764 place count 6188 transition count 6922
Reduce places removed 1763 places and 0 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Iterating post reduction 1 with 1882 rules applied. Total rules applied 3646 place count 4425 transition count 6803
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 2 with 119 rules applied. Total rules applied 3765 place count 4306 transition count 6803
Performed 221 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 221 Pre rules applied. Total rules applied 3765 place count 4306 transition count 6582
Deduced a syphon composed of 221 places in 5 ms
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 3 with 442 rules applied. Total rules applied 4207 place count 4085 transition count 6582
Discarding 1627 places :
Symmetric choice reduction at 3 with 1627 rule applications. Total rules 5834 place count 2458 transition count 4955
Iterating global reduction 3 with 1627 rules applied. Total rules applied 7461 place count 2458 transition count 4955
Discarding 183 places :
Symmetric choice reduction at 3 with 183 rule applications. Total rules 7644 place count 2275 transition count 3674
Iterating global reduction 3 with 183 rules applied. Total rules applied 7827 place count 2275 transition count 3674
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 7845 place count 2266 transition count 3665
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 3 with 65 rules applied. Total rules applied 7910 place count 2266 transition count 3600
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 7975 place count 2201 transition count 3600
Partial Free-agglomeration rule applied 223 times.
Drop transitions removed 223 transitions
Iterating global reduction 4 with 223 rules applied. Total rules applied 8198 place count 2201 transition count 3600
Applied a total of 8198 rules in 1435 ms. Remains 2201 /6222 variables (removed 4021) and now considering 3600/8685 (removed 5085) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1436 ms. Remains : 2201/6222 places, 3600/8685 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 58971 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{2=1}
Probabilistic random walk after 58971 steps, saw 27000 distinct states, run finished after 3001 ms. (steps per millisecond=19 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C07-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
[2023-03-13 08:46:09] [INFO ] Flow matrix only has 3263 transitions (discarded 337 similar events)
// Phase 1: matrix 3263 rows 2201 cols
[2023-03-13 08:46:09] [INFO ] Computed 577 place invariants in 44 ms
[2023-03-13 08:46:10] [INFO ] [Real]Absence check using 33 positive place invariants in 43 ms returned sat
[2023-03-13 08:46:10] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 108 ms returned sat
[2023-03-13 08:46:10] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:46:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2023-03-13 08:46:10] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 113 ms returned sat
[2023-03-13 08:46:13] [INFO ] After 2445ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:46:13] [INFO ] State equation strengthened by 1352 read => feed constraints.
[2023-03-13 08:46:16] [INFO ] After 3317ms SMT Verify possible using 1352 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:46:18] [INFO ] Deduced a trap composed of 342 places in 1339 ms of which 12 ms to minimize.
[2023-03-13 08:46:20] [INFO ] Deduced a trap composed of 385 places in 1346 ms of which 2 ms to minimize.
[2023-03-13 08:46:23] [INFO ] Deduced a trap composed of 316 places in 1334 ms of which 2 ms to minimize.
[2023-03-13 08:46:25] [INFO ] Deduced a trap composed of 357 places in 1280 ms of which 4 ms to minimize.
[2023-03-13 08:46:26] [INFO ] Deduced a trap composed of 302 places in 1238 ms of which 3 ms to minimize.
[2023-03-13 08:46:28] [INFO ] Deduced a trap composed of 379 places in 1326 ms of which 2 ms to minimize.
[2023-03-13 08:46:29] [INFO ] Deduced a trap composed of 363 places in 1317 ms of which 2 ms to minimize.
[2023-03-13 08:46:31] [INFO ] Deduced a trap composed of 292 places in 1325 ms of which 2 ms to minimize.
[2023-03-13 08:46:32] [INFO ] Deduced a trap composed of 335 places in 1286 ms of which 2 ms to minimize.
[2023-03-13 08:46:34] [INFO ] Deduced a trap composed of 335 places in 1313 ms of which 2 ms to minimize.
[2023-03-13 08:46:35] [INFO ] Deduced a trap composed of 315 places in 1310 ms of which 2 ms to minimize.
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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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)
[2023-03-13 08:46:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 08:46:35] [INFO ] After 25441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 6 ms.
Support contains 50 out of 2201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2201/2201 places, 3600/3600 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 2201 transition count 3587
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 2188 transition count 3586
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 2187 transition count 3586
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 28 place count 2187 transition count 3575
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 50 place count 2176 transition count 3575
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 79 place count 2147 transition count 3468
Iterating global reduction 3 with 29 rules applied. Total rules applied 108 place count 2147 transition count 3468
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 2147 transition count 3467
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 2146 transition count 3467
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 124 place count 2132 transition count 3369
Iterating global reduction 3 with 14 rules applied. Total rules applied 138 place count 2132 transition count 3369
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 148 place count 2127 transition count 3364
Free-agglomeration rule (complex) applied 45 times.
Iterating global reduction 3 with 45 rules applied. Total rules applied 193 place count 2127 transition count 3319
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 238 place count 2082 transition count 3319
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 243 place count 2077 transition count 3314
Iterating global reduction 4 with 5 rules applied. Total rules applied 248 place count 2077 transition count 3314
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 253 place count 2072 transition count 3279
Iterating global reduction 4 with 5 rules applied. Total rules applied 258 place count 2072 transition count 3279
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 266 place count 2072 transition count 3279
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 271 place count 2067 transition count 3274
Iterating global reduction 4 with 5 rules applied. Total rules applied 276 place count 2067 transition count 3274
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 281 place count 2062 transition count 3239
Iterating global reduction 4 with 5 rules applied. Total rules applied 286 place count 2062 transition count 3239
Applied a total of 286 rules in 732 ms. Remains 2062 /2201 variables (removed 139) and now considering 3239/3600 (removed 361) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 732 ms. Remains : 2062/2201 places, 3239/3600 transitions.
Incomplete random walk after 10000 steps, including 195 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 64073 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64073 steps, saw 29150 distinct states, run finished after 3002 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 08:46:39] [INFO ] Flow matrix only has 2861 transitions (discarded 378 similar events)
// Phase 1: matrix 2861 rows 2062 cols
[2023-03-13 08:46:39] [INFO ] Computed 577 place invariants in 69 ms
[2023-03-13 08:46:40] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2023-03-13 08:46:40] [INFO ] [Real]Absence check using 33 positive and 544 generalized place invariants in 121 ms returned sat
[2023-03-13 08:46:40] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:46:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2023-03-13 08:46:40] [INFO ] [Nat]Absence check using 33 positive and 544 generalized place invariants in 110 ms returned sat
[2023-03-13 08:46:42] [INFO ] After 1948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:46:42] [INFO ] State equation strengthened by 1130 read => feed constraints.
[2023-03-13 08:46:47] [INFO ] After 4963ms SMT Verify possible using 1130 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:46:50] [INFO ] Deduced a trap composed of 284 places in 1199 ms of which 2 ms to minimize.
[2023-03-13 08:46:51] [INFO ] Deduced a trap composed of 302 places in 1205 ms of which 2 ms to minimize.
[2023-03-13 08:46:53] [INFO ] Deduced a trap composed of 375 places in 1225 ms of which 3 ms to minimize.
[2023-03-13 08:46:55] [INFO ] Deduced a trap composed of 279 places in 1180 ms of which 2 ms to minimize.
[2023-03-13 08:46:56] [INFO ] Deduced a trap composed of 347 places in 1193 ms of which 2 ms to minimize.
[2023-03-13 08:46:57] [INFO ] Deduced a trap composed of 357 places in 1175 ms of which 2 ms to minimize.
[2023-03-13 08:46:59] [INFO ] Deduced a trap composed of 312 places in 1179 ms of which 2 ms to minimize.
[2023-03-13 08:47:00] [INFO ] Deduced a trap composed of 320 places in 1194 ms of which 2 ms to minimize.
[2023-03-13 08:47:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 11344 ms
[2023-03-13 08:47:00] [INFO ] After 17766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2013 ms.
[2023-03-13 08:47:02] [INFO ] After 22185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 50 out of 2062 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2062/2062 places, 3239/3239 transitions.
Applied a total of 0 rules in 80 ms. Remains 2062 /2062 variables (removed 0) and now considering 3239/3239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 2062/2062 places, 3239/3239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2062/2062 places, 3239/3239 transitions.
Applied a total of 0 rules in 82 ms. Remains 2062 /2062 variables (removed 0) and now considering 3239/3239 (removed 0) transitions.
[2023-03-13 08:47:02] [INFO ] Flow matrix only has 2861 transitions (discarded 378 similar events)
[2023-03-13 08:47:02] [INFO ] Invariant cache hit.
[2023-03-13 08:47:05] [INFO ] Implicit Places using invariants in 2301 ms returned [4, 7, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 36, 47, 59, 73, 88, 103, 104, 105, 106, 107, 108, 109, 110, 122, 132, 140, 146, 150, 153, 170, 176, 179, 180, 181, 184, 185, 186, 187, 191, 195, 202, 211, 221, 233, 246, 259, 261, 262, 263, 264, 265, 266, 276, 284, 290, 294, 296, 298, 318, 324, 328, 329, 330, 331, 332, 333, 334, 336, 338, 343, 350, 358, 368, 382, 393, 394, 395, 396, 397, 398, 399, 400, 408, 414, 418, 420, 422, 424, 441, 447, 450, 451, 452, 453, 454, 455, 457, 459, 464, 467, 472, 478, 486, 495, 504, 505, 506, 507, 508, 509, 510, 511, 517, 521, 523, 525, 528, 530, 548, 555, 558, 560, 561, 563, 564, 565, 570, 574, 576, 579, 583, 589, 596, 603, 604, 605, 606, 607, 608, 609, 610, 614, 616, 618, 620, 622, 624, 642, 649, 652, 654, 655, 656, 658, 659, 663, 665, 667, 669, 671, 675, 683, 688, 689, 690, 691, 692, 693, 694, 695, 697, 699, 701, 703, 705, 707, 725, 731, 734, 735, 736, 737, 738, 739, 740, 741, 743, 745, 747, 749, 751, 753, 756, 759, 760, 761, 762, 763, 764, 766, 770, 774, 776, 778, 780, 798, 804, 807, 808, 809, 810, 811, 812, 813, 814, 816, 818, 820, 822, 824, 826, 828, 831, 832, 833, 834, 835, 836, 837, 838, 840, 842, 844, 846, 848, 850, 867, 869, 872, 875, 876, 877, 878, 879, 880, 881, 882, 884, 886, 888, 890, 892, 894, 896, 899, 900, 901, 902, 903, 904, 905, 906, 908, 911, 913, 915, 917, 919, 936, 942, 945, 946, 947, 948, 949, 950, 952, 954, 956, 958, 962, 964, 966, 968, 971, 972, 973, 974, 975, 976, 977, 978, 980, 982, 984, 986, 988, 990, 1008, 1014, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1026, 1028, 1031, 1033, 1035, 1037, 1039, 1043, 1044, 1045, 1046, 1047, 1048, 1050, 1052, 1054, 1056, 1058, 1063, 1065, 1082, 1088, 1091, 1092, 1093, 1094, 1095, 1096, 1098, 1100, 1102, 1104, 1106, 1111, 1113, 1117, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1134, 1136, 1138, 1140, 1142, 1144, 1161, 1167, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1179, 1181, 1183, 1185, 1188, 1192, 1198, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1219, 1223, 1225, 1227, 1229, 1231, 1254, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1266, 1268, 1270, 1273, 1278, 1284, 1292, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1317, 1323, 1327, 1329, 1331, 1333, 1350, 1356, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1368, 1370, 1372, 1377, 1384, 1392, 1402, 1414, 1415, 1416, 1417, 1418, 1420, 1421, 1431, 1439, 1445, 1449, 1451, 1455, 1473, 1480, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1492, 1494, 1498, 1505, 1514, 1524, 1536, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1569, 1579, 1587, 1593, 1597, 1599, 1616, 1618, 1621, 1624, 1625, 1626, 1627, 1628, 1629, 1630, 1631, 1633, 1637, 1643, 1652, 1663, 1675, 1690, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1727, 1739, 1749, 1757, 1764, 1768, 1786]
Discarding 515 places :
Implicit Place search using SMT only with invariants took 2311 ms to find 515 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1547/2062 places, 3239/3239 transitions.
Discarding 211 places :
Symmetric choice reduction at 0 with 211 rule applications. Total rules 211 place count 1336 transition count 3028
Iterating global reduction 0 with 211 rules applied. Total rules applied 422 place count 1336 transition count 3028
Discarding 210 places :
Symmetric choice reduction at 0 with 210 rule applications. Total rules 632 place count 1126 transition count 2818
Iterating global reduction 0 with 210 rules applied. Total rules applied 842 place count 1126 transition count 2818
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 862 place count 1106 transition count 2678
Iterating global reduction 0 with 20 rules applied. Total rules applied 882 place count 1106 transition count 2678
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 885 place count 1106 transition count 2675
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 888 place count 1103 transition count 2675
Applied a total of 888 rules in 197 ms. Remains 1103 /1547 variables (removed 444) and now considering 2675/3239 (removed 564) transitions.
[2023-03-13 08:47:05] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
// Phase 1: matrix 2297 rows 1103 cols
[2023-03-13 08:47:05] [INFO ] Computed 62 place invariants in 31 ms
[2023-03-13 08:47:06] [INFO ] Implicit Places using invariants in 807 ms returned []
[2023-03-13 08:47:06] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-13 08:47:06] [INFO ] Invariant cache hit.
[2023-03-13 08:47:06] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-13 08:47:17] [INFO ] Implicit Places using invariants and state equation in 11815 ms returned []
Implicit Place search using SMT with State Equation took 12625 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1103/2062 places, 2675/3239 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15217 ms. Remains : 1103/2062 places, 2675/3239 transitions.
Incomplete random walk after 10000 steps, including 204 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 78361 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78361 steps, saw 33640 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 08:47:21] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-13 08:47:21] [INFO ] Invariant cache hit.
[2023-03-13 08:47:21] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-13 08:47:21] [INFO ] [Real]Absence check using 31 positive and 31 generalized place invariants in 7 ms returned sat
[2023-03-13 08:47:21] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:47:21] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-13 08:47:21] [INFO ] [Nat]Absence check using 31 positive and 31 generalized place invariants in 13 ms returned sat
[2023-03-13 08:47:22] [INFO ] After 1080ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:47:22] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-13 08:47:26] [INFO ] After 4257ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:47:27] [INFO ] Deduced a trap composed of 129 places in 439 ms of which 1 ms to minimize.
[2023-03-13 08:47:31] [INFO ] Deduced a trap composed of 158 places in 441 ms of which 0 ms to minimize.
[2023-03-13 08:47:31] [INFO ] Deduced a trap composed of 155 places in 429 ms of which 1 ms to minimize.
[2023-03-13 08:47:32] [INFO ] Deduced a trap composed of 148 places in 432 ms of which 1 ms to minimize.
[2023-03-13 08:47:32] [INFO ] Deduced a trap composed of 187 places in 421 ms of which 0 ms to minimize.
[2023-03-13 08:47:33] [INFO ] Deduced a trap composed of 149 places in 428 ms of which 1 ms to minimize.
[2023-03-13 08:47:33] [INFO ] Deduced a trap composed of 131 places in 464 ms of which 1 ms to minimize.
[2023-03-13 08:47:34] [INFO ] Deduced a trap composed of 159 places in 424 ms of which 1 ms to minimize.
[2023-03-13 08:47:35] [INFO ] Deduced a trap composed of 150 places in 428 ms of which 1 ms to minimize.
[2023-03-13 08:47:35] [INFO ] Deduced a trap composed of 141 places in 423 ms of which 1 ms to minimize.
[2023-03-13 08:47:36] [INFO ] Deduced a trap composed of 156 places in 430 ms of which 1 ms to minimize.
[2023-03-13 08:47:37] [INFO ] Deduced a trap composed of 127 places in 426 ms of which 1 ms to minimize.
[2023-03-13 08:47:37] [INFO ] Deduced a trap composed of 160 places in 426 ms of which 1 ms to minimize.
[2023-03-13 08:47:39] [INFO ] Deduced a trap composed of 131 places in 439 ms of which 1 ms to minimize.
[2023-03-13 08:47:39] [INFO ] Deduced a trap composed of 247 places in 433 ms of which 2 ms to minimize.
[2023-03-13 08:47:40] [INFO ] Deduced a trap composed of 124 places in 441 ms of which 1 ms to minimize.
[2023-03-13 08:47:40] [INFO ] Deduced a trap composed of 133 places in 434 ms of which 4 ms to minimize.
[2023-03-13 08:47:41] [INFO ] Deduced a trap composed of 133 places in 430 ms of which 1 ms to minimize.
[2023-03-13 08:47:42] [INFO ] Deduced a trap composed of 142 places in 428 ms of which 1 ms to minimize.
[2023-03-13 08:47:42] [INFO ] Deduced a trap composed of 130 places in 431 ms of which 2 ms to minimize.
[2023-03-13 08:47:43] [INFO ] Deduced a trap composed of 134 places in 439 ms of which 1 ms to minimize.
[2023-03-13 08:47:43] [INFO ] Deduced a trap composed of 140 places in 433 ms of which 1 ms to minimize.
[2023-03-13 08:47:44] [INFO ] Deduced a trap composed of 258 places in 427 ms of which 1 ms to minimize.
[2023-03-13 08:47:45] [INFO ] Deduced a trap composed of 142 places in 425 ms of which 1 ms to minimize.
[2023-03-13 08:47:45] [INFO ] Deduced a trap composed of 151 places in 431 ms of which 1 ms to minimize.
[2023-03-13 08:47:46] [INFO ] Deduced a trap composed of 144 places in 418 ms of which 1 ms to minimize.
[2023-03-13 08:47:46] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 18983 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
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)
[2023-03-13 08:47:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 08:47:46] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 2 ms.
Support contains 50 out of 1103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 2675/2675 transitions.
Applied a total of 0 rules in 52 ms. Remains 1103 /1103 variables (removed 0) and now considering 2675/2675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1103/1103 places, 2675/2675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1103/1103 places, 2675/2675 transitions.
Applied a total of 0 rules in 50 ms. Remains 1103 /1103 variables (removed 0) and now considering 2675/2675 (removed 0) transitions.
[2023-03-13 08:47:46] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-13 08:47:46] [INFO ] Invariant cache hit.
[2023-03-13 08:47:47] [INFO ] Implicit Places using invariants in 778 ms returned []
[2023-03-13 08:47:47] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-13 08:47:47] [INFO ] Invariant cache hit.
[2023-03-13 08:47:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-13 08:47:59] [INFO ] Implicit Places using invariants and state equation in 11860 ms returned []
Implicit Place search using SMT with State Equation took 12640 ms to find 0 implicit places.
[2023-03-13 08:47:59] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-13 08:47:59] [INFO ] Flow matrix only has 2297 transitions (discarded 378 similar events)
[2023-03-13 08:47:59] [INFO ] Invariant cache hit.
[2023-03-13 08:48:00] [INFO ] Dead Transitions using invariants and state equation in 966 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13833 ms. Remains : 1103/1103 places, 2675/2675 transitions.
Graph (trivial) has 878 edges and 1103 vertex of which 14 / 1103 are part of one of the 1 SCC in 4 ms
Free SCC test removed 13 places
Drop transitions removed 201 transitions
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 596 transitions.
Graph (complete) has 3425 edges and 1090 vertex of which 1078 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Ensure Unique test removed 15 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 1062 transition count 2026
Reduce places removed 51 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 112 rules applied. Total rules applied 167 place count 1011 transition count 1965
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 68 rules applied. Total rules applied 235 place count 981 transition count 1927
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 30 rules applied. Total rules applied 265 place count 966 transition count 1912
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 19 rules applied. Total rules applied 284 place count 959 transition count 1900
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 5 with 15 rules applied. Total rules applied 299 place count 954 transition count 1890
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 311 place count 944 transition count 1888
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 26 Pre rules applied. Total rules applied 311 place count 944 transition count 1862
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 363 place count 918 transition count 1862
Discarding 157 places :
Symmetric choice reduction at 7 with 157 rule applications. Total rules 520 place count 761 transition count 1704
Iterating global reduction 7 with 157 rules applied. Total rules applied 677 place count 761 transition count 1704
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 7 with 88 rules applied. Total rules applied 765 place count 761 transition count 1616
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 0 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 8 with 894 rules applied. Total rules applied 1659 place count 314 transition count 1169
Drop transitions removed 308 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 357 transitions.
Iterating post reduction 8 with 357 rules applied. Total rules applied 2016 place count 314 transition count 812
Discarding 30 places :
Symmetric choice reduction at 9 with 30 rule applications. Total rules 2046 place count 284 transition count 722
Iterating global reduction 9 with 30 rules applied. Total rules applied 2076 place count 284 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2077 place count 284 transition count 721
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -117
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 2095 place count 275 transition count 838
Drop transitions removed 119 transitions
Redundant transition composition rules discarded 119 transitions
Iterating global reduction 10 with 119 rules applied. Total rules applied 2214 place count 275 transition count 719
Discarding 54 places :
Symmetric choice reduction at 10 with 54 rule applications. Total rules 2268 place count 221 transition count 581
Iterating global reduction 10 with 54 rules applied. Total rules applied 2322 place count 221 transition count 581
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 10 with 53 rules applied. Total rules applied 2375 place count 221 transition count 528
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2377 place count 220 transition count 527
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2379 place count 219 transition count 532
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2382 place count 219 transition count 529
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2385 place count 216 transition count 529
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 12 with 14 rules applied. Total rules applied 2399 place count 216 transition count 515
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 12 with 14 rules applied. Total rules applied 2413 place count 202 transition count 515
Partial Free-agglomeration rule applied 35 times.
Drop transitions removed 35 transitions
Iterating global reduction 13 with 35 rules applied. Total rules applied 2448 place count 202 transition count 515
Partial Post-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 13 with 29 rules applied. Total rules applied 2477 place count 202 transition count 515
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 2479 place count 200 transition count 511
Iterating global reduction 13 with 2 rules applied. Total rules applied 2481 place count 200 transition count 511
Applied a total of 2481 rules in 568 ms. Remains 200 /1103 variables (removed 903) and now considering 511/2675 (removed 2164) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 511 rows 200 cols
[2023-03-13 08:48:00] [INFO ] Computed 35 place invariants in 10 ms
[2023-03-13 08:48:00] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 08:48:00] [INFO ] [Real]Absence check using 6 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-13 08:48:00] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:48:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 08:48:00] [INFO ] [Nat]Absence check using 6 positive and 29 generalized place invariants in 4 ms returned sat
[2023-03-13 08:48:01] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:48:01] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-13 08:48:01] [INFO ] After 469ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:48:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-13 08:48:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1103 places, 2675 transitions and 12421 arcs took 17 ms.
[2023-03-13 08:48:01] [INFO ] Flatten gal took : 198 ms
Total runtime 146257 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S16C07
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1103 places, 2675 transitions, 12421 arcs.
Final Score: 503708.621
Took : 30 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS

BK_STOP 1678697313647

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
ERROR in file model.sm near line 16255:
syntax error

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="MultiCrashLeafsetExtension-PT-S16C07"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is MultiCrashLeafsetExtension-PT-S16C07, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856422300791"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C07.tgz
mv MultiCrashLeafsetExtension-PT-S16C07 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;