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.r266-smll-167863541200626.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 marciexred
Input is Peterson-PT-5, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200626
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K 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 Peterson-PT-5-CTLFireability-00
FORMULA_NAME Peterson-PT-5-CTLFireability-01
FORMULA_NAME Peterson-PT-5-CTLFireability-02
FORMULA_NAME Peterson-PT-5-CTLFireability-03
FORMULA_NAME Peterson-PT-5-CTLFireability-04
FORMULA_NAME Peterson-PT-5-CTLFireability-05
FORMULA_NAME Peterson-PT-5-CTLFireability-06
FORMULA_NAME Peterson-PT-5-CTLFireability-07
FORMULA_NAME Peterson-PT-5-CTLFireability-08
FORMULA_NAME Peterson-PT-5-CTLFireability-09
FORMULA_NAME Peterson-PT-5-CTLFireability-10
FORMULA_NAME Peterson-PT-5-CTLFireability-11
FORMULA_NAME Peterson-PT-5-CTLFireability-12
FORMULA_NAME Peterson-PT-5-CTLFireability-13
FORMULA_NAME Peterson-PT-5-CTLFireability-14
FORMULA_NAME Peterson-PT-5-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679202644932

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 05:10:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 05:10:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 05:10:48] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2023-03-19 05:10:48] [INFO ] Transformed 834 places.
[2023-03-19 05:10:48] [INFO ] Transformed 1242 transitions.
[2023-03-19 05:10:48] [INFO ] Found NUPN structural information;
[2023-03-19 05:10:48] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-19 05:10:48] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 99 ms.
Support contains 834 out of 834 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 59 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2023-03-19 05:10:49] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-19 05:10:49] [INFO ] Computed 23 place invariants in 47 ms
[2023-03-19 05:10:50] [INFO ] Implicit Places using invariants in 773 ms returned []
[2023-03-19 05:10:50] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-19 05:10:50] [INFO ] Invariant cache hit.
[2023-03-19 05:10:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:10:51] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
[2023-03-19 05:10:51] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-19 05:10:51] [INFO ] Invariant cache hit.
[2023-03-19 05:10:52] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3655 ms. Remains : 834/834 places, 1242/1242 transitions.
Support contains 834 out of 834 places after structural reductions.
[2023-03-19 05:10:53] [INFO ] Flatten gal took : 237 ms
[2023-03-19 05:10:54] [INFO ] Flatten gal took : 125 ms
[2023-03-19 05:10:54] [INFO ] Input system was already deterministic with 1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 804 ms. (steps per millisecond=12 ) properties (out of 67) seen :45
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-19 05:10:55] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
[2023-03-19 05:10:55] [INFO ] Invariant cache hit.
[2023-03-19 05:10:56] [INFO ] [Real]Absence check using 17 positive place invariants in 29 ms returned sat
[2023-03-19 05:10:56] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-19 05:10:57] [INFO ] After 1422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:22
[2023-03-19 05:10:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-19 05:10:58] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-19 05:11:02] [INFO ] After 3347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :22
[2023-03-19 05:11:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:11:06] [INFO ] After 3616ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :22
[2023-03-19 05:11:07] [INFO ] Deduced a trap composed of 27 places in 927 ms of which 15 ms to minimize.
[2023-03-19 05:11:08] [INFO ] Deduced a trap composed of 27 places in 869 ms of which 2 ms to minimize.
[2023-03-19 05:11:09] [INFO ] Deduced a trap composed of 41 places in 749 ms of which 2 ms to minimize.
[2023-03-19 05:11:10] [INFO ] Deduced a trap composed of 27 places in 738 ms of which 2 ms to minimize.
[2023-03-19 05:11:10] [INFO ] Deduced a trap composed of 85 places in 743 ms of which 3 ms to minimize.
[2023-03-19 05:11:11] [INFO ] Deduced a trap composed of 39 places in 690 ms of which 2 ms to minimize.
[2023-03-19 05:11:12] [INFO ] Deduced a trap composed of 85 places in 703 ms of which 2 ms to minimize.
[2023-03-19 05:11:13] [INFO ] Deduced a trap composed of 49 places in 709 ms of which 2 ms to minimize.
[2023-03-19 05:11:14] [INFO ] Deduced a trap composed of 49 places in 808 ms of which 2 ms to minimize.
[2023-03-19 05:11:15] [INFO ] Deduced a trap composed of 75 places in 835 ms of which 1 ms to minimize.
[2023-03-19 05:11:15] [INFO ] Deduced a trap composed of 183 places in 623 ms of which 2 ms to minimize.
[2023-03-19 05:11:16] [INFO ] Deduced a trap composed of 74 places in 901 ms of which 2 ms to minimize.
[2023-03-19 05:11:17] [INFO ] Deduced a trap composed of 75 places in 921 ms of which 1 ms to minimize.
[2023-03-19 05:11:18] [INFO ] Deduced a trap composed of 74 places in 917 ms of which 1 ms to minimize.
[2023-03-19 05:11:19] [INFO ] Deduced a trap composed of 75 places in 893 ms of which 1 ms to minimize.
[2023-03-19 05:11:20] [INFO ] Deduced a trap composed of 44 places in 779 ms of which 2 ms to minimize.
[2023-03-19 05:11:21] [INFO ] Deduced a trap composed of 32 places in 857 ms of which 3 ms to minimize.
[2023-03-19 05:11:22] [INFO ] Deduced a trap composed of 32 places in 747 ms of which 2 ms to minimize.
[2023-03-19 05:11:23] [INFO ] Deduced a trap composed of 14 places in 565 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-19 05:11:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:11:23] [INFO ] After 25531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:22
Parikh walk visited 2 properties in 1159 ms.
Support contains 388 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 834 transition count 1217
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 809 transition count 1217
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 809 transition count 1193
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 785 transition count 1193
Applied a total of 98 rules in 166 ms. Remains 785 /834 variables (removed 49) and now considering 1193/1242 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 785/834 places, 1193/1242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-19 05:11:25] [INFO ] Flow matrix only has 1073 transitions (discarded 120 similar events)
// Phase 1: matrix 1073 rows 785 cols
[2023-03-19 05:11:25] [INFO ] Computed 23 place invariants in 7 ms
[2023-03-19 05:11:26] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned sat
[2023-03-19 05:11:26] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-19 05:11:26] [INFO ] After 1433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 05:11:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2023-03-19 05:11:27] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 05:11:30] [INFO ] After 2832ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 05:11:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:11:33] [INFO ] After 3213ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 05:11:34] [INFO ] Deduced a trap composed of 11 places in 754 ms of which 1 ms to minimize.
[2023-03-19 05:11:35] [INFO ] Deduced a trap composed of 17 places in 732 ms of which 1 ms to minimize.
[2023-03-19 05:11:36] [INFO ] Deduced a trap composed of 13 places in 626 ms of which 2 ms to minimize.
[2023-03-19 05:11:37] [INFO ] Deduced a trap composed of 21 places in 730 ms of which 1 ms to minimize.
[2023-03-19 05:11:37] [INFO ] Deduced a trap composed of 13 places in 737 ms of which 1 ms to minimize.
[2023-03-19 05:11:38] [INFO ] Deduced a trap composed of 21 places in 719 ms of which 2 ms to minimize.
[2023-03-19 05:11:39] [INFO ] Deduced a trap composed of 51 places in 670 ms of which 1 ms to minimize.
[2023-03-19 05:11:40] [INFO ] Deduced a trap composed of 41 places in 696 ms of which 1 ms to minimize.
[2023-03-19 05:11:41] [INFO ] Deduced a trap composed of 11 places in 703 ms of which 3 ms to minimize.
[2023-03-19 05:11:41] [INFO ] Deduced a trap composed of 72 places in 643 ms of which 1 ms to minimize.
[2023-03-19 05:11:42] [INFO ] Deduced a trap composed of 70 places in 428 ms of which 1 ms to minimize.
[2023-03-19 05:11:43] [INFO ] Deduced a trap composed of 83 places in 679 ms of which 1 ms to minimize.
[2023-03-19 05:11:43] [INFO ] Deduced a trap composed of 51 places in 678 ms of which 1 ms to minimize.
[2023-03-19 05:11:44] [INFO ] Deduced a trap composed of 67 places in 628 ms of which 1 ms to minimize.
[2023-03-19 05:11:45] [INFO ] Deduced a trap composed of 59 places in 656 ms of which 2 ms to minimize.
[2023-03-19 05:11:46] [INFO ] Deduced a trap composed of 83 places in 717 ms of which 5 ms to minimize.
[2023-03-19 05:11:46] [INFO ] Deduced a trap composed of 59 places in 677 ms of which 2 ms to minimize.
[2023-03-19 05:11:47] [INFO ] Deduced a trap composed of 35 places in 665 ms of which 2 ms to minimize.
[2023-03-19 05:11:48] [INFO ] Deduced a trap composed of 133 places in 601 ms of which 1 ms to minimize.
[2023-03-19 05:11:49] [INFO ] Deduced a trap composed of 35 places in 622 ms of which 1 ms to minimize.
[2023-03-19 05:11:49] [INFO ] Deduced a trap composed of 69 places in 688 ms of which 1 ms to minimize.
[2023-03-19 05:11:50] [INFO ] Deduced a trap composed of 107 places in 704 ms of which 1 ms to minimize.
[2023-03-19 05:11:51] [INFO ] Deduced a trap composed of 61 places in 644 ms of which 1 ms to minimize.
[2023-03-19 05:11:52] [INFO ] Deduced a trap composed of 37 places in 668 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-19 05:11:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:11:52] [INFO ] After 25369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 0 properties in 592 ms.
Support contains 386 out of 785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 1193/1193 transitions.
Applied a total of 0 rules in 82 ms. Remains 785 /785 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 785/785 places, 1193/1193 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 93660 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93660 steps, saw 53706 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-19 05:11:56] [INFO ] Flow matrix only has 1073 transitions (discarded 120 similar events)
[2023-03-19 05:11:56] [INFO ] Invariant cache hit.
[2023-03-19 05:11:57] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-03-19 05:11:57] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-19 05:11:57] [INFO ] After 1034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 05:11:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 21 ms returned sat
[2023-03-19 05:11:58] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-19 05:12:02] [INFO ] After 3895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 05:12:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:12:05] [INFO ] After 3080ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 05:12:06] [INFO ] Deduced a trap composed of 51 places in 727 ms of which 2 ms to minimize.
[2023-03-19 05:12:07] [INFO ] Deduced a trap composed of 15 places in 732 ms of which 3 ms to minimize.
[2023-03-19 05:12:08] [INFO ] Deduced a trap composed of 11 places in 724 ms of which 1 ms to minimize.
[2023-03-19 05:12:09] [INFO ] Deduced a trap composed of 79 places in 618 ms of which 1 ms to minimize.
[2023-03-19 05:12:09] [INFO ] Deduced a trap composed of 17 places in 735 ms of which 1 ms to minimize.
[2023-03-19 05:12:10] [INFO ] Deduced a trap composed of 11 places in 722 ms of which 1 ms to minimize.
[2023-03-19 05:12:11] [INFO ] Deduced a trap composed of 11 places in 726 ms of which 1 ms to minimize.
[2023-03-19 05:12:12] [INFO ] Deduced a trap composed of 29 places in 643 ms of which 3 ms to minimize.
[2023-03-19 05:12:13] [INFO ] Deduced a trap composed of 35 places in 671 ms of which 1 ms to minimize.
[2023-03-19 05:12:13] [INFO ] Deduced a trap composed of 68 places in 450 ms of which 2 ms to minimize.
[2023-03-19 05:12:14] [INFO ] Deduced a trap composed of 35 places in 610 ms of which 1 ms to minimize.
[2023-03-19 05:12:14] [INFO ] Deduced a trap composed of 41 places in 659 ms of which 1 ms to minimize.
[2023-03-19 05:12:15] [INFO ] Deduced a trap composed of 15 places in 694 ms of which 1 ms to minimize.
[2023-03-19 05:12:16] [INFO ] Deduced a trap composed of 55 places in 686 ms of which 5 ms to minimize.
[2023-03-19 05:12:17] [INFO ] Deduced a trap composed of 15 places in 678 ms of which 1 ms to minimize.
[2023-03-19 05:12:18] [INFO ] Deduced a trap composed of 78 places in 682 ms of which 2 ms to minimize.
[2023-03-19 05:12:18] [INFO ] Deduced a trap composed of 17 places in 658 ms of which 1 ms to minimize.
[2023-03-19 05:12:19] [INFO ] Deduced a trap composed of 57 places in 604 ms of which 0 ms to minimize.
[2023-03-19 05:12:19] [INFO ] Deduced a trap composed of 113 places in 416 ms of which 0 ms to minimize.
[2023-03-19 05:12:20] [INFO ] Deduced a trap composed of 39 places in 412 ms of which 1 ms to minimize.
[2023-03-19 05:12:20] [INFO ] Deduced a trap composed of 57 places in 421 ms of which 1 ms to minimize.
[2023-03-19 05:12:21] [INFO ] Deduced a trap composed of 55 places in 464 ms of which 1 ms to minimize.
[2023-03-19 05:12:21] [INFO ] Deduced a trap composed of 61 places in 413 ms of which 1 ms to minimize.
[2023-03-19 05:12:22] [INFO ] Deduced a trap composed of 65 places in 652 ms of which 3 ms to minimize.
[2023-03-19 05:12:23] [INFO ] Deduced a trap composed of 39 places in 660 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-19 05:12:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:12:23] [INFO ] After 25566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 0 properties in 677 ms.
Support contains 386 out of 785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 1193/1193 transitions.
Applied a total of 0 rules in 65 ms. Remains 785 /785 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 785/785 places, 1193/1193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 1193/1193 transitions.
Applied a total of 0 rules in 49 ms. Remains 785 /785 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
[2023-03-19 05:12:24] [INFO ] Flow matrix only has 1073 transitions (discarded 120 similar events)
[2023-03-19 05:12:24] [INFO ] Invariant cache hit.
[2023-03-19 05:12:24] [INFO ] Implicit Places using invariants in 507 ms returned [744, 756, 757, 758, 759, 760]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 512 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 779/785 places, 1193/1193 transitions.
Applied a total of 0 rules in 30 ms. Remains 779 /779 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 592 ms. Remains : 779/785 places, 1193/1193 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=22 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=26 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 99379 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99379 steps, saw 56545 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 17 properties.
[2023-03-19 05:12:28] [INFO ] Flow matrix only has 1073 transitions (discarded 120 similar events)
// Phase 1: matrix 1073 rows 779 cols
[2023-03-19 05:12:28] [INFO ] Computed 17 place invariants in 7 ms
[2023-03-19 05:12:29] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-03-19 05:12:30] [INFO ] After 1465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-19 05:12:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-03-19 05:12:34] [INFO ] After 3422ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-19 05:12:34] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:12:37] [INFO ] After 2860ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 05:12:38] [INFO ] Deduced a trap composed of 66 places in 685 ms of which 3 ms to minimize.
[2023-03-19 05:12:38] [INFO ] Deduced a trap composed of 11 places in 646 ms of which 1 ms to minimize.
[2023-03-19 05:12:39] [INFO ] Deduced a trap composed of 11 places in 524 ms of which 1 ms to minimize.
[2023-03-19 05:12:40] [INFO ] Deduced a trap composed of 11 places in 627 ms of which 1 ms to minimize.
[2023-03-19 05:12:40] [INFO ] Deduced a trap composed of 11 places in 641 ms of which 1 ms to minimize.
[2023-03-19 05:12:41] [INFO ] Deduced a trap composed of 33 places in 534 ms of which 1 ms to minimize.
[2023-03-19 05:12:42] [INFO ] Deduced a trap composed of 17 places in 626 ms of which 1 ms to minimize.
[2023-03-19 05:12:42] [INFO ] Deduced a trap composed of 11 places in 610 ms of which 1 ms to minimize.
[2023-03-19 05:12:43] [INFO ] Deduced a trap composed of 97 places in 453 ms of which 1 ms to minimize.
[2023-03-19 05:12:44] [INFO ] Deduced a trap composed of 105 places in 516 ms of which 1 ms to minimize.
[2023-03-19 05:12:44] [INFO ] Deduced a trap composed of 47 places in 520 ms of which 1 ms to minimize.
[2023-03-19 05:12:45] [INFO ] Deduced a trap composed of 90 places in 534 ms of which 1 ms to minimize.
[2023-03-19 05:12:45] [INFO ] Deduced a trap composed of 45 places in 592 ms of which 2 ms to minimize.
[2023-03-19 05:12:46] [INFO ] Deduced a trap composed of 99 places in 535 ms of which 1 ms to minimize.
[2023-03-19 05:12:47] [INFO ] Deduced a trap composed of 73 places in 582 ms of which 1 ms to minimize.
[2023-03-19 05:12:47] [INFO ] Deduced a trap composed of 85 places in 578 ms of which 1 ms to minimize.
[2023-03-19 05:12:48] [INFO ] Deduced a trap composed of 93 places in 543 ms of which 1 ms to minimize.
[2023-03-19 05:12:49] [INFO ] Deduced a trap composed of 73 places in 597 ms of which 1 ms to minimize.
[2023-03-19 05:12:49] [INFO ] Deduced a trap composed of 117 places in 592 ms of which 1 ms to minimize.
[2023-03-19 05:12:50] [INFO ] Deduced a trap composed of 97 places in 535 ms of which 1 ms to minimize.
[2023-03-19 05:12:51] [INFO ] Deduced a trap composed of 146 places in 514 ms of which 1 ms to minimize.
[2023-03-19 05:12:51] [INFO ] Deduced a trap composed of 128 places in 581 ms of which 2 ms to minimize.
[2023-03-19 05:12:52] [INFO ] Deduced a trap composed of 83 places in 459 ms of which 2 ms to minimize.
[2023-03-19 05:12:52] [INFO ] Deduced a trap composed of 91 places in 437 ms of which 1 ms to minimize.
[2023-03-19 05:12:53] [INFO ] Deduced a trap composed of 45 places in 497 ms of which 1 ms to minimize.
[2023-03-19 05:12:54] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 1 ms to minimize.
[2023-03-19 05:12:54] [INFO ] Deduced a trap composed of 49 places in 439 ms of which 1 ms to minimize.
[2023-03-19 05:12:55] [INFO ] Deduced a trap composed of 37 places in 368 ms of which 1 ms to minimize.
[2023-03-19 05:12:55] [INFO ] Trap strengthening (SAT) tested/added 28/28 trap constraints in 17601 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-19 05:12:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 05:12:55] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:17
Parikh walk visited 0 properties in 663 ms.
Support contains 386 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1193/1193 transitions.
Applied a total of 0 rules in 50 ms. Remains 779 /779 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 779/779 places, 1193/1193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 1193/1193 transitions.
Applied a total of 0 rules in 50 ms. Remains 779 /779 variables (removed 0) and now considering 1193/1193 (removed 0) transitions.
[2023-03-19 05:12:55] [INFO ] Flow matrix only has 1073 transitions (discarded 120 similar events)
[2023-03-19 05:12:55] [INFO ] Invariant cache hit.
[2023-03-19 05:12:56] [INFO ] Implicit Places using invariants in 492 ms returned []
[2023-03-19 05:12:56] [INFO ] Flow matrix only has 1073 transitions (discarded 120 similar events)
[2023-03-19 05:12:56] [INFO ] Invariant cache hit.
[2023-03-19 05:12:57] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:12:58] [INFO ] Implicit Places using invariants and state equation in 1903 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
[2023-03-19 05:12:58] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-19 05:12:58] [INFO ] Flow matrix only has 1073 transitions (discarded 120 similar events)
[2023-03-19 05:12:58] [INFO ] Invariant cache hit.
[2023-03-19 05:12:59] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3698 ms. Remains : 779/779 places, 1193/1193 transitions.
[2023-03-19 05:12:59] [INFO ] Flatten gal took : 90 ms
[2023-03-19 05:13:00] [INFO ] Flatten gal took : 92 ms
[2023-03-19 05:13:00] [INFO ] Input system was already deterministic with 1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 8 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:00] [INFO ] Flatten gal took : 40 ms
[2023-03-19 05:13:00] [INFO ] Flatten gal took : 44 ms
[2023-03-19 05:13:00] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 9 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:00] [INFO ] Flatten gal took : 37 ms
[2023-03-19 05:13:00] [INFO ] Flatten gal took : 44 ms
[2023-03-19 05:13:00] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 834 transition count 1092
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 300 place count 684 transition count 1092
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 300 place count 684 transition count 1038
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 408 place count 630 transition count 1038
Applied a total of 408 rules in 64 ms. Remains 630 /834 variables (removed 204) and now considering 1038/1242 (removed 204) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 630/834 places, 1038/1242 transitions.
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 30 ms
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 34 ms
[2023-03-19 05:13:01] [INFO ] Input system was already deterministic with 1038 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 35 ms
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 41 ms
[2023-03-19 05:13:01] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 7 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 35 ms
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 42 ms
[2023-03-19 05:13:01] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 6 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 34 ms
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 41 ms
[2023-03-19 05:13:01] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 6 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 33 ms
[2023-03-19 05:13:01] [INFO ] Flatten gal took : 40 ms
[2023-03-19 05:13:01] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 834 transition count 1216
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 808 transition count 1216
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 131 Pre rules applied. Total rules applied 52 place count 808 transition count 1085
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 314 place count 677 transition count 1085
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 324 place count 672 transition count 1080
Applied a total of 324 rules in 60 ms. Remains 672 /834 variables (removed 162) and now considering 1080/1242 (removed 162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 672/834 places, 1080/1242 transitions.
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 27 ms
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 34 ms
[2023-03-19 05:13:02] [INFO ] Input system was already deterministic with 1080 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 28 ms
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 32 ms
[2023-03-19 05:13:02] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 30 ms
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 32 ms
[2023-03-19 05:13:02] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 28 ms
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 31 ms
[2023-03-19 05:13:02] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 16 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 29 ms
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 33 ms
[2023-03-19 05:13:02] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 359 rules applied. Total rules applied 359 place count 834 transition count 883
Reduce places removed 359 places and 0 transitions.
Iterating post reduction 1 with 359 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 718 place count 475 transition count 703
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 1078 place count 295 transition count 703
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 1138 place count 265 transition count 673
Applied a total of 1138 rules in 47 ms. Remains 265 /834 variables (removed 569) and now considering 673/1242 (removed 569) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 265/834 places, 673/1242 transitions.
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 16 ms
[2023-03-19 05:13:02] [INFO ] Flatten gal took : 17 ms
[2023-03-19 05:13:02] [INFO ] Input system was already deterministic with 673 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1050231 steps, run timeout after 3001 ms. (steps per millisecond=349 ) properties seen :{}
Probabilistic random walk after 1050231 steps, saw 153497 distinct states, run finished after 3001 ms. (steps per millisecond=349 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:13:05] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 265 cols
[2023-03-19 05:13:05] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-19 05:13:06] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-19 05:13:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 05:13:06] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 05:13:06] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:06] [INFO ] After 43ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:06] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-19 05:13:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 05:13:06] [INFO ] After 225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:06] [INFO ] After 69ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:06] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 2 ms to minimize.
[2023-03-19 05:13:07] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 0 ms to minimize.
[2023-03-19 05:13:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2023-03-19 05:13:07] [INFO ] After 541ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 05:13:07] [INFO ] After 877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 673/673 transitions.
Applied a total of 0 rules in 23 ms. Remains 265 /265 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 265/265 places, 673/673 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=210 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 05:13:07] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:07] [INFO ] Invariant cache hit.
[2023-03-19 05:13:07] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-19 05:13:07] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 05:13:07] [INFO ] After 246ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 05:13:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:08] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-19 05:13:08] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 0 ms to minimize.
[2023-03-19 05:13:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-19 05:13:08] [INFO ] After 218ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:08] [INFO ] After 589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:08] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-19 05:13:08] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 05:13:08] [INFO ] After 234ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:08] [INFO ] After 38ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:08] [INFO ] After 91ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 05:13:08] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1988651 steps, run timeout after 6001 ms. (steps per millisecond=331 ) properties seen :{}
Probabilistic random walk after 1988651 steps, saw 285135 distinct states, run finished after 6001 ms. (steps per millisecond=331 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:13:17] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:17] [INFO ] Invariant cache hit.
[2023-03-19 05:13:17] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-19 05:13:17] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 05:13:17] [INFO ] After 242ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 05:13:17] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:17] [INFO ] After 63ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:17] [INFO ] After 431ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-19 05:13:18] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-19 05:13:18] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:18] [INFO ] After 84ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:18] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 0 ms to minimize.
[2023-03-19 05:13:18] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 1 ms to minimize.
[2023-03-19 05:13:19] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 0 ms to minimize.
[2023-03-19 05:13:19] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 0 ms to minimize.
[2023-03-19 05:13:19] [INFO ] Deduced a trap composed of 41 places in 236 ms of which 1 ms to minimize.
[2023-03-19 05:13:19] [INFO ] Deduced a trap composed of 40 places in 234 ms of which 0 ms to minimize.
[2023-03-19 05:13:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1417 ms
[2023-03-19 05:13:19] [INFO ] After 1532ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 05:13:19] [INFO ] After 1927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 673/673 transitions.
Applied a total of 0 rules in 18 ms. Remains 265 /265 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 265/265 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 673/673 transitions.
Applied a total of 0 rules in 18 ms. Remains 265 /265 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2023-03-19 05:13:19] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:19] [INFO ] Invariant cache hit.
[2023-03-19 05:13:20] [INFO ] Implicit Places using invariants in 429 ms returned [229, 241, 242, 243, 244, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 431 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 259/265 places, 673/673 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 460 ms. Remains : 259/265 places, 673/673 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2045 ms. (steps per millisecond=488 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2044637 steps, run timeout after 6001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 2044637 steps, saw 293099 distinct states, run finished after 6001 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:13:28] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
// Phase 1: matrix 553 rows 259 cols
[2023-03-19 05:13:28] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-19 05:13:29] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-19 05:13:29] [INFO ] After 242ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 05:13:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:29] [INFO ] After 62ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:29] [INFO ] After 427ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-19 05:13:29] [INFO ] After 241ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:29] [INFO ] After 60ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:29] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2023-03-19 05:13:30] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2023-03-19 05:13:30] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-19 05:13:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 312 ms
[2023-03-19 05:13:30] [INFO ] After 394ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-19 05:13:30] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2023-03-19 05:13:30] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:30] [INFO ] Invariant cache hit.
[2023-03-19 05:13:30] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-19 05:13:30] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:30] [INFO ] Invariant cache hit.
[2023-03-19 05:13:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:31] [INFO ] Implicit Places using invariants and state equation in 1345 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2023-03-19 05:13:31] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-19 05:13:31] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:31] [INFO ] Invariant cache hit.
[2023-03-19 05:13:32] [INFO ] Dead Transitions using invariants and state equation in 562 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2303 ms. Remains : 259/259 places, 673/673 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=490 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-19 05:13:32] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:32] [INFO ] Invariant cache hit.
[2023-03-19 05:13:32] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-19 05:13:33] [INFO ] After 210ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 05:13:33] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:33] [INFO ] After 34ms SMT Verify possible using 205 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-19 05:13:33] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2023-03-19 05:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-19 05:13:33] [INFO ] After 156ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:33] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:33] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-19 05:13:33] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:33] [INFO ] After 36ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:33] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 05:13:33] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1022112 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1022112 steps, saw 149130 distinct states, run finished after 3001 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:13:36] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:36] [INFO ] Invariant cache hit.
[2023-03-19 05:13:36] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-19 05:13:37] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:37] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:37] [INFO ] After 59ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:37] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-19 05:13:37] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 259/259 places, 673/673 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1013901 steps, run timeout after 3001 ms. (steps per millisecond=337 ) properties seen :{}
Probabilistic random walk after 1013901 steps, saw 148229 distinct states, run finished after 3001 ms. (steps per millisecond=337 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 05:13:40] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:40] [INFO ] Invariant cache hit.
[2023-03-19 05:13:40] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-19 05:13:40] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:40] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:40] [INFO ] After 57ms SMT Verify possible using 205 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:40] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-19 05:13:40] [INFO ] After 485ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 259/259 places, 673/673 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 673/673 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 673/673 (removed 0) transitions.
[2023-03-19 05:13:40] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:40] [INFO ] Invariant cache hit.
[2023-03-19 05:13:41] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-19 05:13:41] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:41] [INFO ] Invariant cache hit.
[2023-03-19 05:13:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-19 05:13:42] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-19 05:13:42] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-19 05:13:42] [INFO ] Flow matrix only has 553 transitions (discarded 120 similar events)
[2023-03-19 05:13:42] [INFO ] Invariant cache hit.
[2023-03-19 05:13:43] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2179 ms. Remains : 259/259 places, 673/673 transitions.
Graph (trivial) has 508 edges and 259 vertex of which 179 / 259 are part of one of the 30 SCC in 6 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 197
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 197
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 79 place count 68 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 37 edges and 68 vertex of which 36 / 68 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 81 place count 38 transition count 195
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 164 edges and 33 vertex of which 9 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 100 output transitions
Drop transitions removed 100 transitions
Graph (trivial) has 46 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 43 rules applied. Total rules applied 124 place count 5 transition count 59
Drop transitions removed 40 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 2 with 52 rules applied. Total rules applied 176 place count 5 transition count 7
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 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 179 place count 3 transition count 6
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 181 place count 3 transition count 4
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 4 with 2 rules applied. Total rules applied 183 place count 2 transition count 3
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 184 place count 2 transition count 2
Applied a total of 184 rules in 39 ms. Remains 2 /259 variables (removed 257) and now considering 2/673 (removed 671) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2023-03-19 05:13:43] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 05:13:43] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 05:13:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 05:13:43] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 05:13:43] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 05:13:43] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 508 edges and 259 vertex of which 179 / 259 are part of one of the 30 SCC in 0 ms
Free SCC test removed 149 places
Drop transitions removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 197
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 197
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 76 place count 70 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 36 edges and 70 vertex of which 30 / 70 are part of one of the 5 SCC in 0 ms
Free SCC test removed 25 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 78 place count 45 transition count 196
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (trivial) has 106 edges and 41 vertex of which 20 / 41 are part of one of the 5 SCC in 1 ms
Free SCC test removed 15 places
Iterating post reduction 1 with 35 rules applied. Total rules applied 113 place count 26 transition count 166
Drop transitions removed 60 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 2 with 123 rules applied. Total rules applied 236 place count 26 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 239 place count 26 transition count 40
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 26 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 241 place count 25 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 242 place count 25 transition count 39
Applied a total of 242 rules in 17 ms. Remains 25 /259 variables (removed 234) and now considering 39/673 (removed 634) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 39 rows 25 cols
[2023-03-19 05:13:43] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-19 05:13:43] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-19 05:13:43] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 05:13:43] [INFO ] After 26ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 05:13:43] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 18 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 834/834 places, 1242/1242 transitions.
[2023-03-19 05:13:43] [INFO ] Flatten gal took : 26 ms
[2023-03-19 05:13:43] [INFO ] Flatten gal took : 28 ms
[2023-03-19 05:13:43] [INFO ] Input system was already deterministic with 1242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 358 transitions
Trivial Post-agglo rules discarded 358 transitions
Performed 358 trivial Post agglomeration. Transition count delta: 358
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 834 transition count 884
Reduce places removed 358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 359 rules applied. Total rules applied 717 place count 476 transition count 883
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 475 transition count 883
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 179 Pre rules applied. Total rules applied 718 place count 475 transition count 704
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 3 with 358 rules applied. Total rules applied 1076 place count 296 transition count 704
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 1136 place count 266 transition count 674
Applied a total of 1136 rules in 45 ms. Remains 266 /834 variables (removed 568) and now considering 674/1242 (removed 568) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 266/834 places, 674/1242 transitions.
[2023-03-19 05:13:43] [INFO ] Flatten gal took : 15 ms
[2023-03-19 05:13:43] [INFO ] Flatten gal took : 17 ms
[2023-03-19 05:13:43] [INFO ] Input system was already deterministic with 674 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 834 transition count 890
Reduce places removed 352 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 354 rules applied. Total rules applied 706 place count 482 transition count 888
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 708 place count 480 transition count 888
Performed 178 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 178 Pre rules applied. Total rules applied 708 place count 480 transition count 710
Deduced a syphon composed of 178 places in 0 ms
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 3 with 356 rules applied. Total rules applied 1064 place count 302 transition count 710
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1120 place count 274 transition count 682
Applied a total of 1120 rules in 44 ms. Remains 274 /834 variables (removed 560) and now considering 682/1242 (removed 560) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 274/834 places, 682/1242 transitions.
[2023-03-19 05:13:43] [INFO ] Flatten gal took : 14 ms
[2023-03-19 05:13:43] [INFO ] Flatten gal took : 16 ms
[2023-03-19 05:13:43] [INFO ] Input system was already deterministic with 682 transitions.
[2023-03-19 05:13:43] [INFO ] Flatten gal took : 65 ms
[2023-03-19 05:13:44] [INFO ] Flatten gal took : 59 ms
[2023-03-19 05:13:44] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 44 ms.
[2023-03-19 05:13:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 834 places, 1242 transitions and 3828 arcs took 7 ms.
Total runtime 176059 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 834 NrTr: 1242 NrArc: 3828)

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

net check time: 0m 0.001sec

init dd package: 0m 3.306sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9632664 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16091320 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 CTLFireability -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.010sec

147656 584891 845420 1069233 1106979 1123184

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="CTLFireability"
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 Peterson-PT-5, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863541200626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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