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.r394-oct2-167903718000526.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldPPPs-PT-100B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000526
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679522889418

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:08:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 22:08:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:08:12] [INFO ] Load time of PNML (sax parser for PT used): 280 ms
[2023-03-22 22:08:12] [INFO ] Transformed 6803 places.
[2023-03-22 22:08:12] [INFO ] Transformed 6303 transitions.
[2023-03-22 22:08:12] [INFO ] Found NUPN structural information;
[2023-03-22 22:08:12] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 691 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 678 ms. (steps per millisecond=14 ) properties (out of 13) seen :2
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-22 22:08:13] [INFO ] Computed 1101 place invariants in 63 ms
[2023-03-22 22:08:16] [INFO ] After 2739ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 22:08:20] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1226 ms returned sat
[2023-03-22 22:08:30] [INFO ] After 9440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 22:08:35] [INFO ] Deduced a trap composed of 23 places in 3977 ms of which 34 ms to minimize.
[2023-03-22 22:08:38] [INFO ] Deduced a trap composed of 11 places in 3322 ms of which 9 ms to minimize.
[2023-03-22 22:08:42] [INFO ] Deduced a trap composed of 24 places in 3246 ms of which 8 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-22 22:08:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:08:42] [INFO ] After 25628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2728 ms.
Support contains 56 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 684 rules applied. Total rules applied 684 place count 6803 transition count 5619
Reduce places removed 684 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 694 rules applied. Total rules applied 1378 place count 6119 transition count 5609
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1388 place count 6109 transition count 5609
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1388 place count 6109 transition count 5109
Deduced a syphon composed of 500 places in 26 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2388 place count 5609 transition count 5109
Discarding 684 places :
Symmetric choice reduction at 3 with 684 rule applications. Total rules 3072 place count 4925 transition count 4425
Iterating global reduction 3 with 684 rules applied. Total rules applied 3756 place count 4925 transition count 4425
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 286 Pre rules applied. Total rules applied 3756 place count 4925 transition count 4139
Deduced a syphon composed of 286 places in 21 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 3 with 572 rules applied. Total rules applied 4328 place count 4639 transition count 4139
Performed 1484 Post agglomeration using F-continuation condition.Transition count delta: 1484
Deduced a syphon composed of 1484 places in 8 ms
Reduce places removed 1484 places and 0 transitions.
Iterating global reduction 3 with 2968 rules applied. Total rules applied 7296 place count 3155 transition count 2655
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 880 times.
Drop transitions removed 880 transitions
Iterating global reduction 3 with 880 rules applied. Total rules applied 8176 place count 3155 transition count 2655
Applied a total of 8176 rules in 2873 ms. Remains 3155 /6803 variables (removed 3648) and now considering 2655/6303 (removed 3648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2874 ms. Remains : 3155/6803 places, 2655/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 10) seen :2
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2655 rows 3155 cols
[2023-03-22 22:08:49] [INFO ] Computed 1101 place invariants in 126 ms
[2023-03-22 22:08:50] [INFO ] After 784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 22:08:51] [INFO ] [Nat]Absence check using 1041 positive place invariants in 228 ms returned sat
[2023-03-22 22:08:51] [INFO ] [Nat]Absence check using 1041 positive and 60 generalized place invariants in 12 ms returned sat
[2023-03-22 22:09:04] [INFO ] After 13268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-22 22:09:05] [INFO ] Deduced a trap composed of 5 places in 392 ms of which 1 ms to minimize.
[2023-03-22 22:09:06] [INFO ] Deduced a trap composed of 6 places in 462 ms of which 1 ms to minimize.
[2023-03-22 22:09:06] [INFO ] Deduced a trap composed of 8 places in 436 ms of which 1 ms to minimize.
[2023-03-22 22:09:07] [INFO ] Deduced a trap composed of 6 places in 481 ms of which 12 ms to minimize.
[2023-03-22 22:09:07] [INFO ] Deduced a trap composed of 7 places in 405 ms of which 1 ms to minimize.
[2023-03-22 22:09:08] [INFO ] Deduced a trap composed of 7 places in 401 ms of which 1 ms to minimize.
[2023-03-22 22:09:08] [INFO ] Deduced a trap composed of 5 places in 356 ms of which 1 ms to minimize.
[2023-03-22 22:09:09] [INFO ] Deduced a trap composed of 4 places in 353 ms of which 1 ms to minimize.
[2023-03-22 22:09:09] [INFO ] Deduced a trap composed of 7 places in 322 ms of which 1 ms to minimize.
[2023-03-22 22:09:09] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2023-03-22 22:09:10] [INFO ] Deduced a trap composed of 6 places in 388 ms of which 1 ms to minimize.
[2023-03-22 22:09:10] [INFO ] Deduced a trap composed of 8 places in 352 ms of which 1 ms to minimize.
[2023-03-22 22:09:11] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2023-03-22 22:09:11] [INFO ] Deduced a trap composed of 8 places in 333 ms of which 23 ms to minimize.
[2023-03-22 22:09:12] [INFO ] Deduced a trap composed of 8 places in 401 ms of which 1 ms to minimize.
[2023-03-22 22:09:12] [INFO ] Deduced a trap composed of 7 places in 379 ms of which 1 ms to minimize.
[2023-03-22 22:09:13] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 1 ms to minimize.
[2023-03-22 22:09:13] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 1 ms to minimize.
[2023-03-22 22:09:14] [INFO ] Deduced a trap composed of 7 places in 404 ms of which 4 ms to minimize.
[2023-03-22 22:09:14] [INFO ] Deduced a trap composed of 8 places in 396 ms of which 0 ms to minimize.
[2023-03-22 22:09:15] [INFO ] Deduced a trap composed of 9 places in 352 ms of which 0 ms to minimize.
[2023-03-22 22:09:15] [INFO ] Deduced a trap composed of 7 places in 354 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-22 22:09:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:09:15] [INFO ] After 25348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1088 ms.
Support contains 50 out of 3155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3155/3155 places, 2655/2655 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 8 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3152 transition count 2652
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 3151 transition count 2651
Applied a total of 7 rules in 427 ms. Remains 3151 /3155 variables (removed 4) and now considering 2651/2655 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 427 ms. Remains : 3151/3155 places, 2651/2655 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 8) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2651 rows 3151 cols
[2023-03-22 22:09:18] [INFO ] Computed 1101 place invariants in 47 ms
[2023-03-22 22:09:19] [INFO ] After 639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 22:09:20] [INFO ] [Nat]Absence check using 1052 positive place invariants in 354 ms returned sat
[2023-03-22 22:09:20] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 25 ms returned sat
[2023-03-22 22:09:32] [INFO ] After 11556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 22:09:32] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-22 22:09:32] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-22 22:09:33] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 18 ms to minimize.
[2023-03-22 22:09:33] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 1 ms to minimize.
[2023-03-22 22:09:33] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 1 ms to minimize.
[2023-03-22 22:09:34] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2023-03-22 22:09:34] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 0 ms to minimize.
[2023-03-22 22:09:34] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2023-03-22 22:09:35] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2023-03-22 22:09:35] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 1 ms to minimize.
[2023-03-22 22:09:35] [INFO ] Deduced a trap composed of 8 places in 179 ms of which 0 ms to minimize.
[2023-03-22 22:09:36] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 0 ms to minimize.
[2023-03-22 22:09:36] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 1 ms to minimize.
[2023-03-22 22:09:36] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 1 ms to minimize.
[2023-03-22 22:09:37] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-22 22:09:37] [INFO ] Deduced a trap composed of 11 places in 290 ms of which 0 ms to minimize.
[2023-03-22 22:09:37] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-22 22:09:38] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 1 ms to minimize.
[2023-03-22 22:09:38] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2023-03-22 22:09:38] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-22 22:09:39] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-22 22:09:39] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2023-03-22 22:09:39] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-22 22:09:39] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-22 22:09:40] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-22 22:09:40] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2023-03-22 22:09:40] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 8516 ms
[2023-03-22 22:09:41] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-22 22:09:41] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2023-03-22 22:09:41] [INFO ] Deduced a trap composed of 14 places in 158 ms of which 0 ms to minimize.
[2023-03-22 22:09:42] [INFO ] Deduced a trap composed of 20 places in 118 ms of which 1 ms to minimize.
[2023-03-22 22:09:42] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 26 ms to minimize.
[2023-03-22 22:09:42] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 0 ms to minimize.
[2023-03-22 22:09:42] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2023-03-22 22:09:43] [INFO ] Deduced a trap composed of 11 places in 131 ms of which 0 ms to minimize.
[2023-03-22 22:09:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2464 ms
[2023-03-22 22:09:43] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-22 22:09:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2023-03-22 22:09:44] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 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-22 22:09:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:09:44] [INFO ] After 25141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1138 ms.
Support contains 49 out of 3151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3151/3151 places, 2651/2651 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3150 transition count 2650
Applied a total of 2 rules in 287 ms. Remains 3150 /3151 variables (removed 1) and now considering 2650/2651 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 3150/3151 places, 2650/2651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 336 ms. (steps per millisecond=29 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 57686 steps, run timeout after 3001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 57686 steps, saw 54846 distinct states, run finished after 3003 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2650 rows 3150 cols
[2023-03-22 22:09:49] [INFO ] Computed 1101 place invariants in 21 ms
[2023-03-22 22:09:50] [INFO ] After 727ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 22:09:51] [INFO ] [Nat]Absence check using 1055 positive place invariants in 291 ms returned sat
[2023-03-22 22:09:51] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 13 ms returned sat
[2023-03-22 22:10:05] [INFO ] After 12433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 22:10:05] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
[2023-03-22 22:10:05] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2023-03-22 22:10:06] [INFO ] Deduced a trap composed of 5 places in 436 ms of which 0 ms to minimize.
[2023-03-22 22:10:06] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 1 ms to minimize.
[2023-03-22 22:10:07] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 1 ms to minimize.
[2023-03-22 22:10:07] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 1 ms to minimize.
[2023-03-22 22:10:08] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 1 ms to minimize.
[2023-03-22 22:10:08] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 1 ms to minimize.
[2023-03-22 22:10:09] [INFO ] Deduced a trap composed of 6 places in 362 ms of which 1 ms to minimize.
[2023-03-22 22:10:09] [INFO ] Deduced a trap composed of 5 places in 377 ms of which 1 ms to minimize.
[2023-03-22 22:10:10] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 1 ms to minimize.
[2023-03-22 22:10:10] [INFO ] Deduced a trap composed of 6 places in 288 ms of which 1 ms to minimize.
[2023-03-22 22:10:10] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 0 ms to minimize.
[2023-03-22 22:10:11] [INFO ] Deduced a trap composed of 3 places in 298 ms of which 0 ms to minimize.
[2023-03-22 22:10:11] [INFO ] Deduced a trap composed of 6 places in 270 ms of which 1 ms to minimize.
[2023-03-22 22:10:12] [INFO ] Deduced a trap composed of 6 places in 279 ms of which 1 ms to minimize.
[2023-03-22 22:10:12] [INFO ] Deduced a trap composed of 6 places in 339 ms of which 1 ms to minimize.
[2023-03-22 22:10:13] [INFO ] Deduced a trap composed of 8 places in 294 ms of which 1 ms to minimize.
[2023-03-22 22:10:13] [INFO ] Deduced a trap composed of 6 places in 292 ms of which 1 ms to minimize.
[2023-03-22 22:10:14] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 1 ms to minimize.
[2023-03-22 22:10:14] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2023-03-22 22:10:14] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
[2023-03-22 22:10:15] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 2 ms to minimize.
[2023-03-22 22:10:15] [INFO ] Deduced a trap composed of 11 places in 237 ms of which 0 ms to minimize.
[2023-03-22 22:10:18] [INFO ] Deduced a trap composed of 2 places in 2766 ms of which 4 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-22 22:10:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 22:10:18] [INFO ] After 27830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 977 ms.
Support contains 49 out of 3150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 175 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 3150/3150 places, 2650/2650 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 221 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
[2023-03-22 22:10:19] [INFO ] Invariant cache hit.
[2023-03-22 22:10:23] [INFO ] Implicit Places using invariants in 3210 ms returned []
[2023-03-22 22:10:23] [INFO ] Invariant cache hit.
[2023-03-22 22:10:29] [INFO ] Implicit Places using invariants and state equation in 6120 ms returned []
Implicit Place search using SMT with State Equation took 9337 ms to find 0 implicit places.
[2023-03-22 22:10:29] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-22 22:10:29] [INFO ] Invariant cache hit.
[2023-03-22 22:10:31] [INFO ] Dead Transitions using invariants and state equation in 2509 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12266 ms. Remains : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 229 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-22 22:10:32] [INFO ] Invariant cache hit.
[2023-03-22 22:10:33] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 22:10:34] [INFO ] [Nat]Absence check using 1055 positive place invariants in 317 ms returned sat
[2023-03-22 22:10:34] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 23 ms returned sat
[2023-03-22 22:10:47] [INFO ] After 12672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-22 22:10:47] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 1 ms to minimize.
[2023-03-22 22:10:48] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2023-03-22 22:10:48] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-22 22:10:49] [INFO ] Deduced a trap composed of 7 places in 406 ms of which 1 ms to minimize.
[2023-03-22 22:10:49] [INFO ] Deduced a trap composed of 5 places in 316 ms of which 0 ms to minimize.
[2023-03-22 22:10:50] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 0 ms to minimize.
[2023-03-22 22:10:50] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 1 ms to minimize.
[2023-03-22 22:10:51] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2023-03-22 22:10:51] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2023-03-22 22:10:51] [INFO ] Deduced a trap composed of 6 places in 323 ms of which 1 ms to minimize.
[2023-03-22 22:10:52] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 0 ms to minimize.
[2023-03-22 22:10:52] [INFO ] Deduced a trap composed of 8 places in 296 ms of which 1 ms to minimize.
[2023-03-22 22:10:53] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2023-03-22 22:10:53] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 0 ms to minimize.
[2023-03-22 22:10:54] [INFO ] Deduced a trap composed of 5 places in 395 ms of which 1 ms to minimize.
[2023-03-22 22:10:54] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2023-03-22 22:10:55] [INFO ] Deduced a trap composed of 3 places in 483 ms of which 1 ms to minimize.
[2023-03-22 22:10:55] [INFO ] Deduced a trap composed of 9 places in 404 ms of which 1 ms to minimize.
[2023-03-22 22:10:56] [INFO ] Deduced a trap composed of 5 places in 421 ms of which 1 ms to minimize.
[2023-03-22 22:10:56] [INFO ] Deduced a trap composed of 6 places in 337 ms of which 0 ms to minimize.
[2023-03-22 22:10:57] [INFO ] Deduced a trap composed of 5 places in 339 ms of which 1 ms to minimize.
[2023-03-22 22:10:57] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 1 ms to minimize.
[2023-03-22 22:10:58] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2023-03-22 22:10:58] [INFO ] Deduced a trap composed of 6 places in 366 ms of which 1 ms to minimize.
[2023-03-22 22:10:59] [INFO ] Deduced a trap composed of 5 places in 422 ms of which 0 ms to minimize.
[2023-03-22 22:10:59] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2023-03-22 22:11:00] [INFO ] Deduced a trap composed of 8 places in 367 ms of which 0 ms to minimize.
[2023-03-22 22:11:00] [INFO ] Deduced a trap composed of 5 places in 299 ms of which 0 ms to minimize.
[2023-03-22 22:11:01] [INFO ] Deduced a trap composed of 8 places in 407 ms of which 4 ms to minimize.
[2023-03-22 22:11:01] [INFO ] Deduced a trap composed of 10 places in 316 ms of which 1 ms to minimize.
[2023-03-22 22:11:02] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 0 ms to minimize.
[2023-03-22 22:11:02] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2023-03-22 22:11:03] [INFO ] Deduced a trap composed of 7 places in 329 ms of which 1 ms to minimize.
[2023-03-22 22:11:03] [INFO ] Deduced a trap composed of 24 places in 419 ms of which 1 ms to minimize.
[2023-03-22 22:11:03] [INFO ] Deduced a trap composed of 7 places in 312 ms of which 1 ms to minimize.
[2023-03-22 22:11:04] [INFO ] Deduced a trap composed of 8 places in 324 ms of which 1 ms to minimize.
[2023-03-22 22:11:04] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 1 ms to minimize.
[2023-03-22 22:11:05] [INFO ] Deduced a trap composed of 6 places in 299 ms of which 2 ms to minimize.
[2023-03-22 22:11:05] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2023-03-22 22:11:06] [INFO ] Deduced a trap composed of 8 places in 390 ms of which 1 ms to minimize.
[2023-03-22 22:11:06] [INFO ] Deduced a trap composed of 8 places in 269 ms of which 0 ms to minimize.
[2023-03-22 22:11:06] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 0 ms to minimize.
[2023-03-22 22:11:07] [INFO ] Deduced a trap composed of 7 places in 274 ms of which 0 ms to minimize.
[2023-03-22 22:11:07] [INFO ] Deduced a trap composed of 11 places in 299 ms of which 1 ms to minimize.
[2023-03-22 22:11:08] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 0 ms to minimize.
[2023-03-22 22:11:08] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-22 22:11:08] [INFO ] Deduced a trap composed of 7 places in 286 ms of which 1 ms to minimize.
[2023-03-22 22:11:09] [INFO ] Deduced a trap composed of 12 places in 270 ms of which 0 ms to minimize.
[2023-03-22 22:11:09] [INFO ] Deduced a trap composed of 15 places in 228 ms of which 1 ms to minimize.
[2023-03-22 22:11:10] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 0 ms to minimize.
[2023-03-22 22:11:10] [INFO ] Deduced a trap composed of 7 places in 335 ms of which 1 ms to minimize.
[2023-03-22 22:11:10] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 1 ms to minimize.
[2023-03-22 22:11:11] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 23606 ms
[2023-03-22 22:11:12] [INFO ] Deduced a trap composed of 11 places in 318 ms of which 0 ms to minimize.
[2023-03-22 22:11:12] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 0 ms to minimize.
[2023-03-22 22:11:13] [INFO ] Deduced a trap composed of 8 places in 278 ms of which 1 ms to minimize.
[2023-03-22 22:11:13] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 14 ms to minimize.
[2023-03-22 22:11:13] [INFO ] Deduced a trap composed of 14 places in 354 ms of which 1 ms to minimize.
[2023-03-22 22:11:14] [INFO ] Deduced a trap composed of 7 places in 467 ms of which 1 ms to minimize.
[2023-03-22 22:11:14] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2023-03-22 22:11:15] [INFO ] Deduced a trap composed of 8 places in 288 ms of which 1 ms to minimize.
[2023-03-22 22:11:15] [INFO ] Deduced a trap composed of 5 places in 379 ms of which 0 ms to minimize.
[2023-03-22 22:11:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4285 ms
[2023-03-22 22:11:16] [INFO ] After 41925ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 918 ms.
[2023-03-22 22:11:17] [INFO ] After 44538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-22 22:11:17] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2023-03-22 22:11:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3150 places, 2650 transitions and 12326 arcs took 21 ms.
[2023-03-22 22:11:18] [INFO ] Flatten gal took : 314 ms
Total runtime 186359 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ShieldPPPs_PT_100B
(NrP: 3150 NrTr: 2650 NrArc: 12326)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.967sec

net check time: 0m 0.003sec

init dd package: 0m 2.873sec


before gc: list nodes free: 1987112

after gc: idd nodes used:517365, unused:63482635; list nodes free:268243623
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6312792 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095324 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.030sec

1078732

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="ShieldPPPs-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldPPPs-PT-100B, 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 r394-oct2-167903718000526"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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