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-167856422300774.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-S16C05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856422300774
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 14K Feb 26 02:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 02:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 02:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 02:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 02:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 26 02:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 02:51 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 4.6M 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-S16C05-ReachabilityCardinality-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678694263916

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 07:57:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 07:57:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 07:57:45] [INFO ] Load time of PNML (sax parser for PT used): 236 ms
[2023-03-13 07:57:45] [INFO ] Transformed 4914 places.
[2023-03-13 07:57:45] [INFO ] Transformed 6913 transitions.
[2023-03-13 07:57:45] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 192 resets, run finished after 555 ms. (steps per millisecond=18 ) properties (out of 16) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 13) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-13 07:57:47] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2023-03-13 07:57:47] [INFO ] Computed 535 place invariants in 353 ms
[2023-03-13 07:57:49] [INFO ] [Real]Absence check using 48 positive place invariants in 21 ms returned sat
[2023-03-13 07:57:49] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 192 ms returned sat
[2023-03-13 07:57:49] [INFO ] After 1636ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:9
[2023-03-13 07:57:50] [INFO ] [Nat]Absence check using 48 positive place invariants in 19 ms returned sat
[2023-03-13 07:57:50] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 328 ms returned sat
[2023-03-13 07:58:00] [INFO ] After 8896ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :3
[2023-03-13 07:58:00] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2023-03-13 07:58:13] [INFO ] After 12915ms SMT Verify possible using 1906 Read/Feed constraints in natural domain returned unsat :9 sat :2
[2023-03-13 07:58:14] [INFO ] After 14506ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 07:58:14] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 65 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.20 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1301 transitions
Trivial Post-agglo rules discarded 1301 transitions
Performed 1301 trivial Post agglomeration. Transition count delta: 1301
Iterating post reduction 0 with 1301 rules applied. Total rules applied 1302 place count 4884 transition count 5612
Reduce places removed 1301 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 1343 rules applied. Total rules applied 2645 place count 3583 transition count 5570
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 2687 place count 3541 transition count 5570
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 164 Pre rules applied. Total rules applied 2687 place count 3541 transition count 5406
Deduced a syphon composed of 164 places in 5 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 328 rules applied. Total rules applied 3015 place count 3377 transition count 5406
Discarding 1154 places :
Symmetric choice reduction at 3 with 1154 rule applications. Total rules 4169 place count 2223 transition count 4252
Iterating global reduction 3 with 1154 rules applied. Total rules applied 5323 place count 2223 transition count 4252
Discarding 196 places :
Symmetric choice reduction at 3 with 196 rule applications. Total rules 5519 place count 2027 transition count 3272
Iterating global reduction 3 with 196 rules applied. Total rules applied 5715 place count 2027 transition count 3272
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 5745 place count 2012 transition count 3257
Free-agglomeration rule (complex) applied 183 times.
Iterating global reduction 3 with 183 rules applied. Total rules applied 5928 place count 2012 transition count 3766
Reduce places removed 183 places and 0 transitions.
Iterating post reduction 3 with 183 rules applied. Total rules applied 6111 place count 1829 transition count 3766
Partial Free-agglomeration rule applied 167 times.
Drop transitions removed 167 transitions
Iterating global reduction 4 with 167 rules applied. Total rules applied 6278 place count 1829 transition count 3766
Applied a total of 6278 rules in 1807 ms. Remains 1829 /4914 variables (removed 3085) and now considering 3766/6913 (removed 3147) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1809 ms. Remains : 1829/4914 places, 3766/6913 transitions.
Incomplete random walk after 10000 steps, including 309 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 56 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 56550 steps, run timeout after 3001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56550 steps, saw 25398 distinct states, run finished after 3002 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-13 07:58:19] [INFO ] Flow matrix only has 3376 transitions (discarded 390 similar events)
// Phase 1: matrix 3376 rows 1829 cols
[2023-03-13 07:58:20] [INFO ] Computed 505 place invariants in 43 ms
[2023-03-13 07:58:20] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 07:58:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2023-03-13 07:58:20] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 104 ms returned sat
[2023-03-13 07:58:22] [INFO ] After 1887ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 07:58:22] [INFO ] State equation strengthened by 1814 read => feed constraints.
[2023-03-13 07:58:25] [INFO ] After 2611ms SMT Verify possible using 1814 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-13 07:58:28] [INFO ] Deduced a trap composed of 287 places in 1081 ms of which 7 ms to minimize.
[2023-03-13 07:58:29] [INFO ] Deduced a trap composed of 297 places in 1176 ms of which 1 ms to minimize.
[2023-03-13 07:58:30] [INFO ] Deduced a trap composed of 281 places in 1042 ms of which 2 ms to minimize.
[2023-03-13 07:58:32] [INFO ] Deduced a trap composed of 225 places in 1053 ms of which 3 ms to minimize.
[2023-03-13 07:58:33] [INFO ] Deduced a trap composed of 246 places in 1052 ms of which 2 ms to minimize.
[2023-03-13 07:58:34] [INFO ] Deduced a trap composed of 277 places in 1062 ms of which 2 ms to minimize.
[2023-03-13 07:58:35] [INFO ] Deduced a trap composed of 309 places in 1044 ms of which 2 ms to minimize.
[2023-03-13 07:58:36] [INFO ] Deduced a trap composed of 265 places in 1051 ms of which 3 ms to minimize.
[2023-03-13 07:58:38] [INFO ] Deduced a trap composed of 284 places in 1032 ms of which 2 ms to minimize.
[2023-03-13 07:58:39] [INFO ] Deduced a trap composed of 281 places in 1052 ms of which 3 ms to minimize.
[2023-03-13 07:58:40] [INFO ] Deduced a trap composed of 288 places in 1044 ms of which 2 ms to minimize.
[2023-03-13 07:58:41] [INFO ] Deduced a trap composed of 302 places in 1046 ms of which 2 ms to minimize.
[2023-03-13 07:58:43] [INFO ] Deduced a trap composed of 301 places in 1050 ms of which 2 ms to minimize.
[2023-03-13 07:58:44] [INFO ] Deduced a trap composed of 308 places in 1055 ms of which 2 ms to minimize.
[2023-03-13 07:58:45] [INFO ] Deduced a trap composed of 314 places in 1029 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 07:58:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 07:58:45] [INFO ] After 25250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 62 out of 1829 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1829/1829 places, 3766/3766 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1829 transition count 3765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1828 transition count 3765
Applied a total of 2 rules in 247 ms. Remains 1828 /1829 variables (removed 1) and now considering 3765/3766 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 1828/1829 places, 3765/3766 transitions.
Incomplete random walk after 10000 steps, including 307 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 56495 steps, run timeout after 3002 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 56495 steps, saw 25369 distinct states, run finished after 3004 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 07:58:49] [INFO ] Flow matrix only has 3374 transitions (discarded 391 similar events)
// Phase 1: matrix 3374 rows 1828 cols
[2023-03-13 07:58:49] [INFO ] Computed 505 place invariants in 60 ms
[2023-03-13 07:58:49] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 07:58:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 27 ms returned sat
[2023-03-13 07:58:49] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 98 ms returned sat
[2023-03-13 07:58:51] [INFO ] After 1640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 07:58:51] [INFO ] State equation strengthened by 1814 read => feed constraints.
[2023-03-13 07:58:53] [INFO ] After 1466ms SMT Verify possible using 1814 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 07:58:54] [INFO ] Deduced a trap composed of 308 places in 1193 ms of which 1 ms to minimize.
[2023-03-13 07:58:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1382 ms
[2023-03-13 07:58:57] [INFO ] Deduced a trap composed of 226 places in 1062 ms of which 1 ms to minimize.
[2023-03-13 07:58:58] [INFO ] Deduced a trap composed of 240 places in 1081 ms of which 2 ms to minimize.
[2023-03-13 07:59:00] [INFO ] Deduced a trap composed of 318 places in 1077 ms of which 1 ms to minimize.
[2023-03-13 07:59:02] [INFO ] Deduced a trap composed of 253 places in 1058 ms of which 2 ms to minimize.
[2023-03-13 07:59:03] [INFO ] Deduced a trap composed of 298 places in 1032 ms of which 2 ms to minimize.
[2023-03-13 07:59:04] [INFO ] Deduced a trap composed of 269 places in 1045 ms of which 2 ms to minimize.
[2023-03-13 07:59:05] [INFO ] Deduced a trap composed of 286 places in 1024 ms of which 2 ms to minimize.
[2023-03-13 07:59:07] [INFO ] Deduced a trap composed of 302 places in 1029 ms of which 1 ms to minimize.
[2023-03-13 07:59:09] [INFO ] Deduced a trap composed of 346 places in 1023 ms of which 2 ms to minimize.
[2023-03-13 07:59:10] [INFO ] Deduced a trap composed of 302 places in 1057 ms of which 2 ms to minimize.
[2023-03-13 07:59:11] [INFO ] Deduced a trap composed of 242 places in 1069 ms of which 2 ms to minimize.
[2023-03-13 07:59:13] [INFO ] Deduced a trap composed of 332 places in 1050 ms of which 1 ms to minimize.
[2023-03-13 07:59:14] [INFO ] Deduced a trap composed of 373 places in 1044 ms of which 1 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 07:59:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 07:59:14] [INFO ] After 25120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 3 ms.
Support contains 62 out of 1828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 3765/3765 transitions.
Applied a total of 0 rules in 100 ms. Remains 1828 /1828 variables (removed 0) and now considering 3765/3765 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1828/1828 places, 3765/3765 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1828/1828 places, 3765/3765 transitions.
Applied a total of 0 rules in 95 ms. Remains 1828 /1828 variables (removed 0) and now considering 3765/3765 (removed 0) transitions.
[2023-03-13 07:59:14] [INFO ] Flow matrix only has 3374 transitions (discarded 391 similar events)
[2023-03-13 07:59:14] [INFO ] Invariant cache hit.
[2023-03-13 07:59:18] [INFO ] Implicit Places using invariants in 3212 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 143, 145, 159, 165, 168, 169, 170, 171, 172, 173, 175, 179, 185, 194, 204, 216, 229, 241, 243, 245, 246, 257, 266, 272, 276, 279, 281, 294, 300, 303, 304, 305, 306, 307, 310, 312, 316, 322, 330, 341, 352, 363, 364, 366, 367, 368, 376, 382, 386, 389, 391, 394, 409, 415, 417, 418, 420, 423, 426, 428, 432, 436, 442, 450, 459, 467, 468, 469, 472, 478, 482, 485, 487, 489, 492, 505, 511, 513, 514, 515, 516, 517, 518, 520, 522, 524, 526, 530, 536, 543, 549, 550, 551, 552, 553, 554, 558, 560, 562, 564, 566, 568, 581, 587, 590, 591, 593, 594, 595, 597, 600, 602, 604, 606, 610, 615, 619, 622, 623, 624, 625, 628, 630, 632, 634, 636, 638, 651, 657, 659, 661, 662, 663, 664, 666, 668, 670, 672, 674, 678, 681, 683, 684, 685, 687, 688, 690, 692, 694, 696, 698, 701, 714, 720, 722, 723, 724, 725, 726, 727, 729, 731, 733, 735, 737, 739, 741, 743, 745, 746, 747, 748, 750, 752, 754, 756, 762, 777, 779, 782, 785, 786, 788, 789, 791, 793, 795, 797, 799, 803, 806, 808, 809, 811, 812, 813, 815, 817, 819, 822, 824, 826, 839, 845, 847, 849, 850, 851, 852, 854, 856, 860, 862, 864, 866, 868, 870, 872, 873, 875, 879, 881, 883, 885, 890, 903, 910, 912, 913, 914, 915, 916, 917, 919, 921, 923, 925, 927, 929, 931, 934, 939, 940, 943, 947, 950, 952, 954, 956, 969, 975, 977, 978, 979, 981, 982, 984, 986, 988, 992, 994, 996, 1000, 1005, 1006, 1007, 1008, 1009, 1010, 1014, 1016, 1018, 1020, 1022, 1024, 1038, 1044, 1046, 1047, 1048, 1049, 1050, 1051, 1053, 1055, 1057, 1060, 1062, 1067, 1074, 1081, 1082, 1083, 1084, 1085, 1086, 1092, 1096, 1098, 1100, 1102, 1104, 1117, 1123, 1125, 1128, 1129, 1130, 1133, 1135, 1138, 1140, 1144, 1150, 1158, 1167, 1168, 1169, 1170, 1171, 1172, 1180, 1186, 1190, 1192, 1194, 1196, 1210, 1217, 1221, 1222, 1223, 1224, 1225, 1228, 1230, 1232, 1236, 1242, 1250, 1260, 1271, 1272, 1273, 1276, 1287, 1296, 1302, 1306, 1308, 1310, 1323, 1329, 1331, 1334, 1335, 1336, 1339, 1341, 1345, 1353, 1361, 1371, 1383, 1397, 1399, 1401, 1413, 1423, 1433, 1441, 1447, 1452, 1467, 1469, 1472, 1474, 1475, 1476, 1477, 1478, 1479, 1481, 1486, 1492, 1500, 1510, 1522, 1536, 1551, 1554, 1555, 1556, 1570, 1582, 1592, 1600, 1607, 1614, 1627]
Discarding 425 places :
Implicit Place search using SMT only with invariants took 3221 ms to find 425 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1403/1828 places, 3765/3765 transitions.
Discarding 123 places :
Symmetric choice reduction at 0 with 123 rule applications. Total rules 123 place count 1280 transition count 3642
Iterating global reduction 0 with 123 rules applied. Total rules applied 246 place count 1280 transition count 3642
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 366 place count 1160 transition count 3522
Iterating global reduction 0 with 120 rules applied. Total rules applied 486 place count 1160 transition count 3522
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 489 place count 1160 transition count 3519
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 492 place count 1157 transition count 3519
Applied a total of 492 rules in 214 ms. Remains 1157 /1403 variables (removed 246) and now considering 3519/3765 (removed 246) transitions.
[2023-03-13 07:59:18] [INFO ] Flow matrix only has 3128 transitions (discarded 391 similar events)
// Phase 1: matrix 3128 rows 1157 cols
[2023-03-13 07:59:18] [INFO ] Computed 80 place invariants in 39 ms
[2023-03-13 07:59:19] [INFO ] Implicit Places using invariants in 1077 ms returned []
[2023-03-13 07:59:19] [INFO ] Flow matrix only has 3128 transitions (discarded 391 similar events)
[2023-03-13 07:59:19] [INFO ] Invariant cache hit.
[2023-03-13 07:59:20] [INFO ] State equation strengthened by 1814 read => feed constraints.
[2023-03-13 07:59:45] [INFO ] Implicit Places using invariants and state equation in 26277 ms returned []
Implicit Place search using SMT with State Equation took 27355 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1157/1828 places, 3519/3765 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30887 ms. Remains : 1157/1828 places, 3519/3765 transitions.
Incomplete random walk after 10000 steps, including 326 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 64243 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 64243 steps, saw 27836 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 07:59:48] [INFO ] Flow matrix only has 3128 transitions (discarded 391 similar events)
[2023-03-13 07:59:48] [INFO ] Invariant cache hit.
[2023-03-13 07:59:49] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 07:59:49] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2023-03-13 07:59:49] [INFO ] [Nat]Absence check using 31 positive and 49 generalized place invariants in 8 ms returned sat
[2023-03-13 07:59:50] [INFO ] After 1263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 07:59:50] [INFO ] State equation strengthened by 1814 read => feed constraints.
[2023-03-13 07:59:52] [INFO ] After 1831ms SMT Verify possible using 1814 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 07:59:53] [INFO ] Deduced a trap composed of 139 places in 507 ms of which 1 ms to minimize.
[2023-03-13 07:59:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 749 ms
[2023-03-13 07:59:54] [INFO ] Deduced a trap composed of 111 places in 503 ms of which 1 ms to minimize.
[2023-03-13 07:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 659 ms
[2023-03-13 07:59:54] [INFO ] After 4106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1235 ms.
[2023-03-13 07:59:55] [INFO ] After 6835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 62 out of 1157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1157/1157 places, 3519/3519 transitions.
Applied a total of 0 rules in 81 ms. Remains 1157 /1157 variables (removed 0) and now considering 3519/3519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1157/1157 places, 3519/3519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1157/1157 places, 3519/3519 transitions.
Applied a total of 0 rules in 78 ms. Remains 1157 /1157 variables (removed 0) and now considering 3519/3519 (removed 0) transitions.
[2023-03-13 07:59:56] [INFO ] Flow matrix only has 3128 transitions (discarded 391 similar events)
[2023-03-13 07:59:56] [INFO ] Invariant cache hit.
[2023-03-13 07:59:57] [INFO ] Implicit Places using invariants in 1025 ms returned []
[2023-03-13 07:59:57] [INFO ] Flow matrix only has 3128 transitions (discarded 391 similar events)
[2023-03-13 07:59:57] [INFO ] Invariant cache hit.
[2023-03-13 07:59:58] [INFO ] State equation strengthened by 1814 read => feed constraints.
[2023-03-13 08:00:21] [INFO ] Implicit Places using invariants and state equation in 24394 ms returned []
Implicit Place search using SMT with State Equation took 25425 ms to find 0 implicit places.
[2023-03-13 08:00:21] [INFO ] Redundant transitions in 227 ms returned []
[2023-03-13 08:00:21] [INFO ] Flow matrix only has 3128 transitions (discarded 391 similar events)
[2023-03-13 08:00:21] [INFO ] Invariant cache hit.
[2023-03-13 08:00:22] [INFO ] Dead Transitions using invariants and state equation in 1286 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27028 ms. Remains : 1157/1157 places, 3519/3519 transitions.
Graph (trivial) has 1035 edges and 1157 vertex of which 15 / 1157 are part of one of the 1 SCC in 4 ms
Free SCC test removed 14 places
Drop transitions removed 223 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 634 transitions.
Graph (complete) has 4614 edges and 1143 vertex of which 1129 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Ensure Unique test removed 18 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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 1110 transition count 2811
Reduce places removed 72 places and 0 transitions.
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 1 with 190 rules applied. Total rules applied 266 place count 1038 transition count 2693
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 2 with 133 rules applied. Total rules applied 399 place count 979 transition count 2619
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 65 rules applied. Total rules applied 464 place count 948 transition count 2585
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 4 with 37 rules applied. Total rules applied 501 place count 931 transition count 2565
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 5 with 18 rules applied. Total rules applied 519 place count 923 transition count 2555
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 6 with 11 rules applied. Total rules applied 530 place count 918 transition count 2549
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 535 place count 913 transition count 2549
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 43 Pre rules applied. Total rules applied 535 place count 913 transition count 2506
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 8 with 86 rules applied. Total rules applied 621 place count 870 transition count 2506
Discarding 144 places :
Symmetric choice reduction at 8 with 144 rule applications. Total rules 765 place count 726 transition count 1886
Iterating global reduction 8 with 144 rules applied. Total rules applied 909 place count 726 transition count 1886
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 932 place count 726 transition count 1863
Performed 307 Post agglomeration using F-continuation condition.Transition count delta: 307
Deduced a syphon composed of 307 places in 0 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 9 with 614 rules applied. Total rules applied 1546 place count 419 transition count 1556
Drop transitions removed 150 transitions
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 283 transitions.
Iterating post reduction 9 with 283 rules applied. Total rules applied 1829 place count 419 transition count 1273
Discarding 15 places :
Symmetric choice reduction at 10 with 15 rule applications. Total rules 1844 place count 404 transition count 1187
Iterating global reduction 10 with 15 rules applied. Total rules applied 1859 place count 404 transition count 1187
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1867 place count 400 transition count 1231
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 1868 place count 399 transition count 1226
Iterating global reduction 10 with 1 rules applied. Total rules applied 1869 place count 399 transition count 1226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1871 place count 399 transition count 1224
Drop transitions removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 11 with 102 rules applied. Total rules applied 1973 place count 399 transition count 1122
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node10IsNotRespondingToNode0ToReplaceNode7.Node5IsNotRespondingToNode0ToReplaceNode7.Node11IsNotRespondingToNode0ToReplaceNode7.Node4IsNotRespondingToNode0ToReplaceNode7.Node12IsNotRespondingToNode0ToReplaceNode7.Node3IsNotRespondingToNode0ToReplaceNode7.Node13IsNotRespondingToNode0ToReplaceNode7.Node2IsNotRespondingToNode0ToReplaceNode7.Node14IsNotRespondingToNode0ToReplaceNode7.Node0DetectsThatNode1CanReplaceNode7.Node1IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 11 with 41 rules applied. Total rules applied 2014 place count 398 transition count 1081
Reduce places removed 39 places and 0 transitions.
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 12 with 76 rules applied. Total rules applied 2090 place count 359 transition count 1044
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2093 place count 356 transition count 1044
Discarding 50 places :
Symmetric choice reduction at 14 with 50 rule applications. Total rules 2143 place count 306 transition count 794
Iterating global reduction 14 with 50 rules applied. Total rules applied 2193 place count 306 transition count 794
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 14 with 15 rules applied. Total rules applied 2208 place count 306 transition count 779
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 15 with 2 rules applied. Total rules applied 2210 place count 305 transition count 778
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2211 place count 305 transition count 777
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 16 with 6 rules applied. Total rules applied 2217 place count 305 transition count 771
Free-agglomeration rule applied 1 times.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2218 place count 305 transition count 770
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 2219 place count 304 transition count 770
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 17 with 20 rules applied. Total rules applied 2239 place count 304 transition count 750
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 17 with 20 rules applied. Total rules applied 2259 place count 284 transition count 750
Partial Free-agglomeration rule applied 220 times.
Drop transitions removed 220 transitions
Iterating global reduction 18 with 220 rules applied. Total rules applied 2479 place count 284 transition count 750
Partial Post-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 18 with 12 rules applied. Total rules applied 2491 place count 284 transition count 750
Applied a total of 2491 rules in 1092 ms. Remains 284 /1157 variables (removed 873) and now considering 750/3519 (removed 2769) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 750 rows 284 cols
[2023-03-13 08:00:24] [INFO ] Computed 48 place invariants in 13 ms
[2023-03-13 08:00:24] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 08:00:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-13 08:00:24] [INFO ] [Nat]Absence check using 3 positive and 45 generalized place invariants in 7 ms returned sat
[2023-03-13 08:00:24] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 08:00:24] [INFO ] After 318ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-13 08:00:24] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 08:00:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2023-03-13 08:00:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1157 places, 3519 transitions and 17487 arcs took 23 ms.
[2023-03-13 08:00:25] [INFO ] Flatten gal took : 288 ms
Total runtime 159790 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running MultiCrashLeafsetExtension (PT), instance S16C05
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 1157 places, 3519 transitions, 17487 arcs.
Final Score: 542784.924
Took : 58 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-10 (reachable &!potential( ( ( (tk(P607)) <= (tk(P461)) ) | ( ( (tk(P373)) <= ( 4 ) ) & ( (! ( (tk(P199)) <= ( 2 ) )) & ( ( (! ( (tk(P954)) <= ( 3 ) )) | ( ( ( (tk(P309)) <= ( 0 ) ) | (! ( (tk(P331)) <= (tk(P835)) )) ) & ( (! ( (tk(P707)) <= (tk(P630)) )) | (! ( (tk(P702)) <= (tk(P576)) )) ) ) ) | ( ( ( (tk(P431)) <= (tk(P814)) ) & ( ( 1 ) <= (tk(P542)) ) ) | ( ( (! ( (tk(P609)) <= (tk(P859)) )) & ( (! ( (tk(P865)) <= ( 4 ) )) & (! ( (tk(P665)) <= (tk(P510)) )) ) ) | ( ( (tk(P961)) <= (tk(P325)) ) & ( ( (tk(P930)) <= ( 4 ) ) & ( ( ( 1 ) <= (tk(P146)) ) | ( (tk(P306)) <= ( 5 ) ) ) ) ) ) ) ) ) ) )))
PROPERTY: MultiCrashLeafsetExtension-PT-S16C05-ReachabilityCardinality-11 (reachable & potential(( (! ( (tk(P518)) <= (tk(P1114)) )) & ( ( ( (! ( (tk(P148)) <= (tk(P752)) )) | ( ( (tk(P241)) <= ( 5 ) ) & (! ( ( 2 ) <= (tk(P764)) )) ) ) | ( ( ( ( ( 1 ) <= (tk(P474)) ) & ( (tk(P601)) <= (tk(P946)) ) ) & ( (! ( (tk(P433)) <= ( 0 ) )) & ( (tk(P848)) <= (tk(P448)) ) ) ) | ( ( ( ( (tk(P1077)) <= (tk(P313)) ) & (! ( ( 1 ) <= (tk(P485)) )) ) & ( (! ( (tk(P567)) <= ( 2 ) )) & ( (! ( ( 1 ) <= (tk(P560)) )) | (! ( (tk(P377)) <= (tk(P261)) )) ) ) ) | ( ( (tk(P218)) <= (tk(P1082)) ) & ( ( ( ( 2 ) <= (tk(P6)) ) | ( (tk(P535)) <= ( 2 ) ) ) | ( ( (tk(P575)) <= (tk(P1097)) ) | ( ( (tk(P588)) <= (tk(P533)) ) | ( ( (tk(P514)) <= (tk(P942)) ) & ( (! ( (tk(P789)) <= (tk(P937)) )) | (! ( (tk(P513)) <= (tk(P1071)) )) ) ) ) ) ) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P1082)) )) | ( ( 4 ) <= (tk(P669)) ) ) | ( (! ( ( 4 ) <= (tk(P662)) )) | ( (! ( (tk(P822)) <= ( 4 ) )) & (! ( ( 2 ) <= (tk(P759)) )) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14670112 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093820 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-S16C05"
export BK_EXAMINATION="ReachabilityCardinality"
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-S16C05, examination is ReachabilityCardinality"
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-167856422300774"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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