/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:48:59,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:48:59,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:48:59,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:48:59,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:48:59,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:48:59,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:48:59,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:48:59,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:48:59,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:48:59,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:48:59,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:48:59,377 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:48:59,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:48:59,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:48:59,378 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:48:59,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:48:59,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:48:59,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:48:59,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:48:59,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:48:59,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:48:59,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:48:59,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:48:59,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:48:59,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:48:59,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:48:59,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:48:59,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:48:59,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:48:59,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:48:59,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:48:59,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:48:59,397 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:48:59,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:48:59,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:48:59,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:48:59,399 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:48:59,399 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:48:59,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:48:59,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:48:59,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 07:48:59,425 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:48:59,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:48:59,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:48:59,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:48:59,427 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:48:59,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:48:59,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:48:59,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:48:59,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:48:59,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:48:59,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:48:59,429 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:48:59,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:48:59,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:48:59,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:48:59,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:48:59,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:48:59,430 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:48:59,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:48:59,430 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:48:59,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 07:48:59,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:48:59,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:48:59,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:48:59,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:48:59,725 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:48:59,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-12-13 07:49:00,637 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:49:00,827 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:49:00,828 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c [2022-12-13 07:49:00,840 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41aa38952/89ac29422bf642f49911976ce63cc930/FLAG52b64644b [2022-12-13 07:49:00,851 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41aa38952/89ac29422bf642f49911976ce63cc930 [2022-12-13 07:49:00,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:49:00,854 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:49:00,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:49:00,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:49:00,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:49:00,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:49:00" (1/1) ... [2022-12-13 07:49:00,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5cc91b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:00, skipping insertion in model container [2022-12-13 07:49:00,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:49:00" (1/1) ... [2022-12-13 07:49:00,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:49:00,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:49:00,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:49:00,980 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:49:00,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:49:00,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:49:00,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:49:00,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:49:00,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:49:00,991 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:49:01,005 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2022-12-13 07:49:01,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:49:01,020 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:49:01,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:49:01,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:49:01,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:49:01,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:49:01,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:49:01,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:49:01,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 07:49:01,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 07:49:01,058 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-counter-determinism.wvr.c[2476,2489] [2022-12-13 07:49:01,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:49:01,070 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:49:01,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01 WrapperNode [2022-12-13 07:49:01,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:49:01,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:49:01,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:49:01,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:49:01,078 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,091 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,115 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 116 [2022-12-13 07:49:01,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:49:01,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:49:01,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:49:01,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:49:01,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,145 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,149 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:49:01,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:49:01,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:49:01,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:49:01,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (1/1) ... [2022-12-13 07:49:01,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:49:01,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:01,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 07:49:01,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 07:49:01,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:49:01,210 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:49:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:49:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:49:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:49:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:49:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:49:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-13 07:49:01,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-13 07:49:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:49:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:49:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:49:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 07:49:01,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 07:49:01,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:49:01,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:49:01,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:49:01,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:49:01,213 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 07:49:01,324 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:49:01,326 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:49:01,519 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:49:01,551 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:49:01,551 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 07:49:01,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:49:01 BoogieIcfgContainer [2022-12-13 07:49:01,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:49:01,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:49:01,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:49:01,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:49:01,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:49:00" (1/3) ... [2022-12-13 07:49:01,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de6b34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:49:01, skipping insertion in model container [2022-12-13 07:49:01,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:49:01" (2/3) ... [2022-12-13 07:49:01,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de6b34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:49:01, skipping insertion in model container [2022-12-13 07:49:01,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:49:01" (3/3) ... [2022-12-13 07:49:01,559 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2022-12-13 07:49:01,572 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:49:01,572 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:49:01,572 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:49:01,632 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-13 07:49:01,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 119 transitions, 270 flow [2022-12-13 07:49:01,715 INFO L130 PetriNetUnfolder]: 9/115 cut-off events. [2022-12-13 07:49:01,715 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:49:01,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 115 events. 9/115 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 07:49:01,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 119 transitions, 270 flow [2022-12-13 07:49:01,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 103 transitions, 230 flow [2022-12-13 07:49:01,725 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:01,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 103 transitions, 230 flow [2022-12-13 07:49:01,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 103 transitions, 230 flow [2022-12-13 07:49:01,774 INFO L130 PetriNetUnfolder]: 9/103 cut-off events. [2022-12-13 07:49:01,774 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:49:01,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 103 events. 9/103 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2022-12-13 07:49:01,777 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 103 transitions, 230 flow [2022-12-13 07:49:01,783 INFO L226 LiptonReduction]: Number of co-enabled transitions 2520 [2022-12-13 07:49:04,454 INFO L241 LiptonReduction]: Total number of compositions: 74 [2022-12-13 07:49:04,465 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:49:04,470 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79f0ee39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:49:04,470 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 07:49:04,476 INFO L130 PetriNetUnfolder]: 4/28 cut-off events. [2022-12-13 07:49:04,476 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 07:49:04,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:04,477 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:04,477 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:04,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:04,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2014537320, now seen corresponding path program 1 times [2022-12-13 07:49:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:04,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172050204] [2022-12-13 07:49:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:04,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:04,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:04,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172050204] [2022-12-13 07:49:04,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172050204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:04,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:04,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 07:49:04,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712193062] [2022-12-13 07:49:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:04,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:49:04,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:04,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:49:04,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:49:04,871 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 07:49:04,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:04,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:04,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 07:49:04,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:05,070 INFO L130 PetriNetUnfolder]: 1537/1954 cut-off events. [2022-12-13 07:49:05,070 INFO L131 PetriNetUnfolder]: For 155/155 co-relation queries the response was YES. [2022-12-13 07:49:05,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6421 event pairs, 141 based on Foata normal form. 1/1127 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2022-12-13 07:49:05,087 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2022-12-13 07:49:05,087 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2022-12-13 07:49:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:49:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:49:05,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-12-13 07:49:05,097 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6896551724137931 [2022-12-13 07:49:05,101 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-13 07:49:05,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 51 transitions, 241 flow [2022-12-13 07:49:05,110 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 50 transitions, 234 flow [2022-12-13 07:49:05,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:05,121 INFO L89 Accepts]: Start accepts. Operand has 40 places, 50 transitions, 234 flow [2022-12-13 07:49:05,125 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:05,125 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:05,126 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 50 transitions, 234 flow [2022-12-13 07:49:05,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 50 transitions, 234 flow [2022-12-13 07:49:05,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-13 07:49:05,133 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:05,135 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 07:49:05,135 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 50 transitions, 234 flow [2022-12-13 07:49:05,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:05,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:05,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:05,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:49:05,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:05,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash 2118314327, now seen corresponding path program 1 times [2022-12-13 07:49:05,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:05,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165066084] [2022-12-13 07:49:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:05,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:05,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:05,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165066084] [2022-12-13 07:49:05,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165066084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:05,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:05,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:05,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150523456] [2022-12-13 07:49:05,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:05,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:05,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:05,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:05,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:05,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:05,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 50 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:05,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:05,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:05,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:05,621 INFO L130 PetriNetUnfolder]: 2755/3618 cut-off events. [2022-12-13 07:49:05,621 INFO L131 PetriNetUnfolder]: For 671/713 co-relation queries the response was YES. [2022-12-13 07:49:05,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10866 conditions, 3618 events. 2755/3618 cut-off events. For 671/713 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 15015 event pairs, 233 based on Foata normal form. 2/2323 useless extension candidates. Maximal degree in co-relation 9833. Up to 2831 conditions per place. [2022-12-13 07:49:05,639 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 134 selfloop transitions, 6 changer transitions 0/142 dead transitions. [2022-12-13 07:49:05,639 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 142 transitions, 950 flow [2022-12-13 07:49:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 07:49:05,641 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6482758620689655 [2022-12-13 07:49:05,642 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2022-12-13 07:49:05,642 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 142 transitions, 950 flow [2022-12-13 07:49:05,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 142 transitions, 950 flow [2022-12-13 07:49:05,672 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:05,672 INFO L89 Accepts]: Start accepts. Operand has 44 places, 142 transitions, 950 flow [2022-12-13 07:49:05,673 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:05,673 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:05,673 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 142 transitions, 950 flow [2022-12-13 07:49:05,677 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 142 transitions, 950 flow [2022-12-13 07:49:05,677 INFO L226 LiptonReduction]: Number of co-enabled transitions 322 [2022-12-13 07:49:05,678 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:05,679 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:49:05,679 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 142 transitions, 950 flow [2022-12-13 07:49:05,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:05,680 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:05,680 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:05,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:49:05,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:05,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:05,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1974860140, now seen corresponding path program 1 times [2022-12-13 07:49:05,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:05,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387354500] [2022-12-13 07:49:05,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:05,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:05,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387354500] [2022-12-13 07:49:05,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387354500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:05,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:05,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:05,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106316606] [2022-12-13 07:49:05,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:05,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:05,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:05,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:05,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:05,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:05,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 142 transitions, 950 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:05,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:05,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:05,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:05,994 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([454] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][109], [thread2Thread1of1ForFork1InUse, 73#L72-4true, thread4Thread1of1ForFork0InUse, 107#L41-4true, 138#true, 7#L91-4true, 102#thread3EXITtrue, 131#(= thread1Thread1of1ForFork3_~i~0 0), thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-13 07:49:05,995 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 07:49:05,995 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:05,995 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 07:49:05,995 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 07:49:05,995 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2][110], [thread2Thread1of1ForFork1InUse, 73#L72-4true, 138#true, thread4Thread1of1ForFork0InUse, 107#L41-4true, 7#L91-4true, 131#(= thread1Thread1of1ForFork3_~i~0 0), thread3Thread1of1ForFork2InUse, 98#L51-4true, 66#L62-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-13 07:49:05,995 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-13 07:49:05,995 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:05,995 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 07:49:05,995 INFO L385 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2022-12-13 07:49:06,041 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([454] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][109], [5#thread2EXITtrue, thread2Thread1of1ForFork1InUse, 73#L72-4true, 107#L41-4true, 138#true, thread4Thread1of1ForFork0InUse, 102#thread3EXITtrue, 131#(= thread1Thread1of1ForFork3_~i~0 0), 7#L91-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-13 07:49:06,042 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,042 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,042 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:06,042 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:06,042 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2][110], [5#thread2EXITtrue, thread2Thread1of1ForFork1InUse, 73#L72-4true, 107#L41-4true, thread4Thread1of1ForFork0InUse, 138#true, 131#(= thread1Thread1of1ForFork3_~i~0 0), 7#L91-4true, 66#L62-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-13 07:49:06,042 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,042 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:06,042 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,042 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:06,045 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([454] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][109], [thread2Thread1of1ForFork1InUse, 73#L72-4true, 138#true, 107#L41-4true, 80#L92-1true, thread4Thread1of1ForFork0InUse, 102#thread3EXITtrue, 131#(= thread1Thread1of1ForFork3_~i~0 0), thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-13 07:49:06,045 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,045 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:06,045 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:06,045 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,046 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2][110], [thread2Thread1of1ForFork1InUse, 73#L72-4true, 107#L41-4true, 138#true, 80#L92-1true, thread4Thread1of1ForFork0InUse, 131#(= thread1Thread1of1ForFork3_~i~0 0), 66#L62-4true, thread3Thread1of1ForFork2InUse, 98#L51-4true, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-13 07:49:06,046 INFO L382 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,046 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,046 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:06,046 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-13 07:49:06,087 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([454] L62-4-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.base_Out_2| 0) (not (< v_thread3Thread1of1ForFork2_~i~2_In_1 v_~N~0_In_5)) (= |v_thread3Thread1of1ForFork2_#res.offset_Out_2| 0)) InVars {thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1, ~N~0=v_~N~0_In_5} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_2|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_2|, ~N~0=v_~N~0_In_5, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_In_1} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base][109], [5#thread2EXITtrue, thread2Thread1of1ForFork1InUse, 73#L72-4true, 107#L41-4true, 138#true, thread4Thread1of1ForFork0InUse, 80#L92-1true, 102#thread3EXITtrue, 131#(= thread1Thread1of1ForFork3_~i~0 0), thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-13 07:49:06,088 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 07:49:06,088 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 07:49:06,088 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,088 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,088 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([442] L62-4-->L62-4: Formula: (and (= (+ v_~counter2~0_87 1) v_~counter2~0_86) (= v_thread3Thread1of1ForFork2_~i~2_27 (+ v_thread3Thread1of1ForFork2_~i~2_28 1)) (< v_thread3Thread1of1ForFork2_~i~2_28 v_~N~0_65)) InVars {~counter2~0=v_~counter2~0_87, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_28} OutVars{~counter2~0=v_~counter2~0_86, thread3Thread1of1ForFork2_#t~post5=|v_thread3Thread1of1ForFork2_#t~post5_19|, thread3Thread1of1ForFork2_#t~post6=|v_thread3Thread1of1ForFork2_#t~post6_15|, ~N~0=v_~N~0_65, thread3Thread1of1ForFork2_~i~2=v_thread3Thread1of1ForFork2_~i~2_27} AuxVars[] AssignedVars[~counter2~0, thread3Thread1of1ForFork2_#t~post5, thread3Thread1of1ForFork2_#t~post6, thread3Thread1of1ForFork2_~i~2][110], [5#thread2EXITtrue, thread2Thread1of1ForFork1InUse, 73#L72-4true, 107#L41-4true, 138#true, thread4Thread1of1ForFork0InUse, 80#L92-1true, 131#(= thread1Thread1of1ForFork3_~i~0 0), 66#L62-4true, thread3Thread1of1ForFork2InUse, thread1Thread1of1ForFork3InUse, 126#true]) [2022-12-13 07:49:06,088 INFO L382 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2022-12-13 07:49:06,088 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,088 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-13 07:49:06,089 INFO L385 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2022-12-13 07:49:06,199 INFO L130 PetriNetUnfolder]: 4316/5790 cut-off events. [2022-12-13 07:49:06,199 INFO L131 PetriNetUnfolder]: For 3352/3380 co-relation queries the response was YES. [2022-12-13 07:49:06,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22593 conditions, 5790 events. 4316/5790 cut-off events. For 3352/3380 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 27371 event pairs, 299 based on Foata normal form. 17/3895 useless extension candidates. Maximal degree in co-relation 21310. Up to 4400 conditions per place. [2022-12-13 07:49:06,241 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 354 selfloop transitions, 18 changer transitions 6/380 dead transitions. [2022-12-13 07:49:06,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 380 transitions, 3291 flow [2022-12-13 07:49:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:06,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 07:49:06,243 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-13 07:49:06,245 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-13 07:49:06,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 380 transitions, 3291 flow [2022-12-13 07:49:06,274 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 374 transitions, 3237 flow [2022-12-13 07:49:06,310 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:06,311 INFO L89 Accepts]: Start accepts. Operand has 48 places, 374 transitions, 3237 flow [2022-12-13 07:49:06,313 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:06,313 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:06,313 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 374 transitions, 3237 flow [2022-12-13 07:49:06,349 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 374 transitions, 3237 flow [2022-12-13 07:49:06,349 INFO L226 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-13 07:49:06,351 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:06,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 07:49:06,352 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 374 transitions, 3237 flow [2022-12-13 07:49:06,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:06,352 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:06,352 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:06,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:49:06,352 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash -131546890, now seen corresponding path program 2 times [2022-12-13 07:49:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:06,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065224879] [2022-12-13 07:49:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:06,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:06,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065224879] [2022-12-13 07:49:06,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065224879] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:06,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:06,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774925037] [2022-12-13 07:49:06,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:06,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:06,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:06,435 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:06,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 374 transitions, 3237 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:06,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:06,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:06,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:07,182 INFO L130 PetriNetUnfolder]: 6849/9316 cut-off events. [2022-12-13 07:49:07,182 INFO L131 PetriNetUnfolder]: For 12650/13037 co-relation queries the response was YES. [2022-12-13 07:49:07,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44319 conditions, 9316 events. 6849/9316 cut-off events. For 12650/13037 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 45438 event pairs, 284 based on Foata normal form. 177/6652 useless extension candidates. Maximal degree in co-relation 42198. Up to 6789 conditions per place. [2022-12-13 07:49:07,221 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 841 selfloop transitions, 56 changer transitions 60/961 dead transitions. [2022-12-13 07:49:07,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 961 transitions, 10195 flow [2022-12-13 07:49:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-13 07:49:07,222 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.593103448275862 [2022-12-13 07:49:07,223 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-13 07:49:07,223 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 961 transitions, 10195 flow [2022-12-13 07:49:07,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 901 transitions, 9541 flow [2022-12-13 07:49:07,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:07,291 INFO L89 Accepts]: Start accepts. Operand has 52 places, 901 transitions, 9541 flow [2022-12-13 07:49:07,293 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:07,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:07,294 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 901 transitions, 9541 flow [2022-12-13 07:49:07,308 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 901 transitions, 9541 flow [2022-12-13 07:49:07,308 INFO L226 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-13 07:49:07,312 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:07,313 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-13 07:49:07,313 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 901 transitions, 9541 flow [2022-12-13 07:49:07,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:07,313 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:07,313 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:07,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:49:07,314 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:07,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1872425550, now seen corresponding path program 1 times [2022-12-13 07:49:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:07,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416462823] [2022-12-13 07:49:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:07,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:07,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:07,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:07,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416462823] [2022-12-13 07:49:07,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416462823] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:07,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:07,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:07,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876398284] [2022-12-13 07:49:07,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:07,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:07,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:07,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:07,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:07,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:07,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 901 transitions, 9541 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:07,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:07,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:07,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:08,644 INFO L130 PetriNetUnfolder]: 9132/12472 cut-off events. [2022-12-13 07:49:08,645 INFO L131 PetriNetUnfolder]: For 20807/21315 co-relation queries the response was YES. [2022-12-13 07:49:08,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71297 conditions, 12472 events. 9132/12472 cut-off events. For 20807/21315 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 63563 event pairs, 392 based on Foata normal form. 220/8781 useless extension candidates. Maximal degree in co-relation 68273. Up to 9753 conditions per place. [2022-12-13 07:49:08,710 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 1682 selfloop transitions, 139 changer transitions 152/1977 dead transitions. [2022-12-13 07:49:08,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 1977 transitions, 24853 flow [2022-12-13 07:49:08,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:08,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-13 07:49:08,713 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5793103448275863 [2022-12-13 07:49:08,715 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-13 07:49:08,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 1977 transitions, 24853 flow [2022-12-13 07:49:08,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 1825 transitions, 22897 flow [2022-12-13 07:49:08,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:08,897 INFO L89 Accepts]: Start accepts. Operand has 56 places, 1825 transitions, 22897 flow [2022-12-13 07:49:08,902 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:08,902 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:08,902 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 1825 transitions, 22897 flow [2022-12-13 07:49:08,947 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 1825 transitions, 22897 flow [2022-12-13 07:49:08,948 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 07:49:08,953 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:08,954 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 57 [2022-12-13 07:49:08,954 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 1825 transitions, 22897 flow [2022-12-13 07:49:08,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:08,954 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:08,954 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:08,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:49:08,955 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:08,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:08,955 INFO L85 PathProgramCache]: Analyzing trace with hash -181224074, now seen corresponding path program 2 times [2022-12-13 07:49:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:08,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820251487] [2022-12-13 07:49:08,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:08,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:09,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:09,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820251487] [2022-12-13 07:49:09,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820251487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:09,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:09,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:09,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009619279] [2022-12-13 07:49:09,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:09,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:09,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:09,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:09,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:09,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:09,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 1825 transitions, 22897 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:09,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:09,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:09,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:11,024 INFO L130 PetriNetUnfolder]: 9512/13128 cut-off events. [2022-12-13 07:49:11,024 INFO L131 PetriNetUnfolder]: For 27943/28576 co-relation queries the response was YES. [2022-12-13 07:49:11,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87245 conditions, 13128 events. 9512/13128 cut-off events. For 27943/28576 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 68086 event pairs, 380 based on Foata normal form. 476/9684 useless extension candidates. Maximal degree in co-relation 83400. Up to 10387 conditions per place. [2022-12-13 07:49:11,168 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 1946 selfloop transitions, 129 changer transitions 92/2179 dead transitions. [2022-12-13 07:49:11,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 2179 transitions, 31737 flow [2022-12-13 07:49:11,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-13 07:49:11,170 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6344827586206897 [2022-12-13 07:49:11,172 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2022-12-13 07:49:11,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 2179 transitions, 31737 flow [2022-12-13 07:49:11,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 2087 transitions, 30353 flow [2022-12-13 07:49:11,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:11,283 INFO L89 Accepts]: Start accepts. Operand has 60 places, 2087 transitions, 30353 flow [2022-12-13 07:49:11,290 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:11,290 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:11,290 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 2087 transitions, 30353 flow [2022-12-13 07:49:11,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 2087 transitions, 30353 flow [2022-12-13 07:49:11,330 INFO L226 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-13 07:49:11,335 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:11,336 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 07:49:11,336 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 2087 transitions, 30353 flow [2022-12-13 07:49:11,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:11,336 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:11,336 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:11,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:49:11,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:11,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:11,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1690560816, now seen corresponding path program 3 times [2022-12-13 07:49:11,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:11,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51448155] [2022-12-13 07:49:11,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:11,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:11,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:11,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51448155] [2022-12-13 07:49:11,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51448155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:11,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:11,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10443839] [2022-12-13 07:49:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:11,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:11,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:11,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:11,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:11,386 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:11,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 2087 transitions, 30353 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:11,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:11,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:11,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:13,819 INFO L130 PetriNetUnfolder]: 10074/14143 cut-off events. [2022-12-13 07:49:13,819 INFO L131 PetriNetUnfolder]: For 39783/40115 co-relation queries the response was YES. [2022-12-13 07:49:13,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107316 conditions, 14143 events. 10074/14143 cut-off events. For 39783/40115 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 76867 event pairs, 376 based on Foata normal form. 186/10316 useless extension candidates. Maximal degree in co-relation 102451. Up to 11157 conditions per place. [2022-12-13 07:49:13,905 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2296 selfloop transitions, 133 changer transitions 115/2556 dead transitions. [2022-12-13 07:49:13,905 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 2556 transitions, 42280 flow [2022-12-13 07:49:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:13,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 07:49:13,906 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-13 07:49:13,906 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2022-12-13 07:49:13,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 2556 transitions, 42280 flow [2022-12-13 07:49:14,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 2441 transitions, 40323 flow [2022-12-13 07:49:14,095 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:14,095 INFO L89 Accepts]: Start accepts. Operand has 64 places, 2441 transitions, 40323 flow [2022-12-13 07:49:14,103 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:14,103 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:14,103 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 2441 transitions, 40323 flow [2022-12-13 07:49:14,153 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 2441 transitions, 40323 flow [2022-12-13 07:49:14,153 INFO L226 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-13 07:49:14,160 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:14,161 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 66 [2022-12-13 07:49:14,161 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 2441 transitions, 40323 flow [2022-12-13 07:49:14,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:14,161 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:14,162 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:14,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:49:14,162 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:14,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash 851763662, now seen corresponding path program 1 times [2022-12-13 07:49:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:14,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118376033] [2022-12-13 07:49:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:14,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118376033] [2022-12-13 07:49:14,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118376033] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:49:14,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834961333] [2022-12-13 07:49:14,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:14,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:14,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:49:14,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 07:49:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:14,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:49:14,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:49:14,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:14,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:49:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:14,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834961333] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:49:14,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:49:14,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:49:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617461309] [2022-12-13 07:49:14,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:49:14,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:49:14,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:14,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:49:14,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:49:14,417 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:14,417 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 2441 transitions, 40323 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:14,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:14,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:14,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:17,515 INFO L130 PetriNetUnfolder]: 10527/14677 cut-off events. [2022-12-13 07:49:17,515 INFO L131 PetriNetUnfolder]: For 44678/45366 co-relation queries the response was YES. [2022-12-13 07:49:17,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125354 conditions, 14677 events. 10527/14677 cut-off events. For 44678/45366 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 78475 event pairs, 384 based on Foata normal form. 265/10803 useless extension candidates. Maximal degree in co-relation 119974. Up to 11875 conditions per place. [2022-12-13 07:49:17,597 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2566 selfloop transitions, 89 changer transitions 0/2690 dead transitions. [2022-12-13 07:49:17,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 2690 transitions, 49676 flow [2022-12-13 07:49:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-13 07:49:17,598 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-13 07:49:17,598 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2022-12-13 07:49:17,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 2690 transitions, 49676 flow [2022-12-13 07:49:17,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 2690 transitions, 49676 flow [2022-12-13 07:49:17,757 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:17,757 INFO L89 Accepts]: Start accepts. Operand has 68 places, 2690 transitions, 49676 flow [2022-12-13 07:49:17,768 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:17,768 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:17,769 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 2690 transitions, 49676 flow [2022-12-13 07:49:17,808 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 2690 transitions, 49676 flow [2022-12-13 07:49:17,808 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 07:49:17,816 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:17,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 07:49:17,817 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 2690 transitions, 49676 flow [2022-12-13 07:49:17,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:17,818 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:17,818 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:17,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 07:49:18,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:18,019 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash -997540835, now seen corresponding path program 2 times [2022-12-13 07:49:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:18,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618479824] [2022-12-13 07:49:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:18,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618479824] [2022-12-13 07:49:18,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618479824] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:49:18,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74602644] [2022-12-13 07:49:18,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:49:18,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:18,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:18,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:49:18,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 07:49:18,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:49:18,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:49:18,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:49:18,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:49:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:18,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:49:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:18,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74602644] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:49:18,252 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:49:18,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:49:18,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681933753] [2022-12-13 07:49:18,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:49:18,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:49:18,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:18,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:49:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:49:18,254 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:18,254 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 2690 transitions, 49676 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:18,254 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:18,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:18,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:22,261 INFO L130 PetriNetUnfolder]: 11174/15653 cut-off events. [2022-12-13 07:49:22,261 INFO L131 PetriNetUnfolder]: For 61823/61823 co-relation queries the response was YES. [2022-12-13 07:49:22,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148190 conditions, 15653 events. 11174/15653 cut-off events. For 61823/61823 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 85229 event pairs, 184 based on Foata normal form. 126/11429 useless extension candidates. Maximal degree in co-relation 142247. Up to 12707 conditions per place. [2022-12-13 07:49:22,373 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 2878 selfloop transitions, 123 changer transitions 94/3122 dead transitions. [2022-12-13 07:49:22,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 3122 transitions, 63676 flow [2022-12-13 07:49:22,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:22,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:22,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 07:49:22,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-13 07:49:22,375 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 34 predicate places. [2022-12-13 07:49:22,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 3122 transitions, 63676 flow [2022-12-13 07:49:22,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 3028 transitions, 61786 flow [2022-12-13 07:49:22,601 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:22,601 INFO L89 Accepts]: Start accepts. Operand has 72 places, 3028 transitions, 61786 flow [2022-12-13 07:49:22,613 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:22,613 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:22,614 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 3028 transitions, 61786 flow [2022-12-13 07:49:22,661 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 3028 transitions, 61786 flow [2022-12-13 07:49:22,661 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:22,668 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:22,669 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 68 [2022-12-13 07:49:22,669 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 3028 transitions, 61786 flow [2022-12-13 07:49:22,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:22,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:22,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:22,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 07:49:22,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-13 07:49:22,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:22,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1996807278, now seen corresponding path program 2 times [2022-12-13 07:49:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:22,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443464035] [2022-12-13 07:49:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:22,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443464035] [2022-12-13 07:49:22,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443464035] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:22,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:22,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:22,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48324076] [2022-12-13 07:49:22,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:22,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:22,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:22,946 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:22,946 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 3028 transitions, 61786 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:22,947 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:22,947 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:22,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:27,574 INFO L130 PetriNetUnfolder]: 11462/16195 cut-off events. [2022-12-13 07:49:27,574 INFO L131 PetriNetUnfolder]: For 71936/71936 co-relation queries the response was YES. [2022-12-13 07:49:27,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169104 conditions, 16195 events. 11462/16195 cut-off events. For 71936/71936 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 90101 event pairs, 184 based on Foata normal form. 38/11777 useless extension candidates. Maximal degree in co-relation 161875. Up to 13125 conditions per place. [2022-12-13 07:49:27,670 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 3030 selfloop transitions, 184 changer transitions 63/3324 dead transitions. [2022-12-13 07:49:27,670 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 3324 transitions, 74444 flow [2022-12-13 07:49:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2022-12-13 07:49:27,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6344827586206897 [2022-12-13 07:49:27,671 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 38 predicate places. [2022-12-13 07:49:27,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 3324 transitions, 74444 flow [2022-12-13 07:49:27,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 3261 transitions, 73052 flow [2022-12-13 07:49:27,856 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:27,856 INFO L89 Accepts]: Start accepts. Operand has 76 places, 3261 transitions, 73052 flow [2022-12-13 07:49:27,871 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:27,872 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:27,872 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 3261 transitions, 73052 flow [2022-12-13 07:49:27,923 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 3261 transitions, 73052 flow [2022-12-13 07:49:27,924 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:27,931 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:27,932 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 76 [2022-12-13 07:49:27,932 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 3261 transitions, 73052 flow [2022-12-13 07:49:27,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:27,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:27,933 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:27,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 07:49:27,933 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:27,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:27,933 INFO L85 PathProgramCache]: Analyzing trace with hash 472302521, now seen corresponding path program 3 times [2022-12-13 07:49:27,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:27,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600314204] [2022-12-13 07:49:27,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:27,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:28,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:28,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600314204] [2022-12-13 07:49:28,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600314204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:28,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:28,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:28,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331423128] [2022-12-13 07:49:28,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:28,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:28,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:28,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:28,005 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:28,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 3261 transitions, 73052 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:28,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:28,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:28,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:33,216 INFO L130 PetriNetUnfolder]: 11930/17061 cut-off events. [2022-12-13 07:49:33,217 INFO L131 PetriNetUnfolder]: For 88611/88611 co-relation queries the response was YES. [2022-12-13 07:49:33,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194761 conditions, 17061 events. 11930/17061 cut-off events. For 88611/88611 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 98082 event pairs, 168 based on Foata normal form. 94/12551 useless extension candidates. Maximal degree in co-relation 185690. Up to 13917 conditions per place. [2022-12-13 07:49:33,345 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 3268 selfloop transitions, 251 changer transitions 117/3665 dead transitions. [2022-12-13 07:49:33,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 3665 transitions, 89399 flow [2022-12-13 07:49:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:49:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:49:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 07:49:33,346 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-13 07:49:33,347 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-13 07:49:33,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 3665 transitions, 89399 flow [2022-12-13 07:49:33,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 3548 transitions, 86535 flow [2022-12-13 07:49:33,715 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:33,716 INFO L89 Accepts]: Start accepts. Operand has 80 places, 3548 transitions, 86535 flow [2022-12-13 07:49:33,730 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:33,730 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:33,730 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 3548 transitions, 86535 flow [2022-12-13 07:49:33,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 3548 transitions, 86535 flow [2022-12-13 07:49:33,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:33,800 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:33,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-13 07:49:33,800 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 3548 transitions, 86535 flow [2022-12-13 07:49:33,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:33,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:33,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:33,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 07:49:33,801 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:33,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:33,801 INFO L85 PathProgramCache]: Analyzing trace with hash 667081099, now seen corresponding path program 4 times [2022-12-13 07:49:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:33,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794882410] [2022-12-13 07:49:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:33,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:33,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794882410] [2022-12-13 07:49:33,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794882410] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:49:33,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317916850] [2022-12-13 07:49:33,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:49:33,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:33,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:49:33,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:49:33,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 07:49:33,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:49:33,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:49:33,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:49:33,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:49:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:33,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:49:33,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:33,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317916850] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:49:33,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:49:33,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:49:33,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488743637] [2022-12-13 07:49:33,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:49:33,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:49:33,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:33,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:49:33,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:49:33,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:33,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 3548 transitions, 86535 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:33,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:33,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:33,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:42,585 INFO L130 PetriNetUnfolder]: 15491/22164 cut-off events. [2022-12-13 07:49:42,585 INFO L131 PetriNetUnfolder]: For 130919/130919 co-relation queries the response was YES. [2022-12-13 07:49:42,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275599 conditions, 22164 events. 15491/22164 cut-off events. For 130919/130919 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 132491 event pairs, 168 based on Foata normal form. 126/16308 useless extension candidates. Maximal degree in co-relation 263427. Up to 18279 conditions per place. [2022-12-13 07:49:42,745 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 4598 selfloop transitions, 291 changer transitions 93/5011 dead transitions. [2022-12-13 07:49:42,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 5011 transitions, 132436 flow [2022-12-13 07:49:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:49:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:49:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2022-12-13 07:49:42,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 07:49:42,746 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2022-12-13 07:49:42,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 5011 transitions, 132436 flow [2022-12-13 07:49:42,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 4918 transitions, 129961 flow [2022-12-13 07:49:43,059 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:43,059 INFO L89 Accepts]: Start accepts. Operand has 87 places, 4918 transitions, 129961 flow [2022-12-13 07:49:43,081 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:43,081 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:43,081 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 4918 transitions, 129961 flow [2022-12-13 07:49:43,189 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 4918 transitions, 129961 flow [2022-12-13 07:49:43,189 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:43,200 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:43,201 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 142 [2022-12-13 07:49:43,201 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 4918 transitions, 129961 flow [2022-12-13 07:49:43,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:43,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:43,201 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:43,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 07:49:43,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:49:43,402 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:43,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:43,402 INFO L85 PathProgramCache]: Analyzing trace with hash 148292061, now seen corresponding path program 5 times [2022-12-13 07:49:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:43,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148260738] [2022-12-13 07:49:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:43,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:43,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:43,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148260738] [2022-12-13 07:49:43,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148260738] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:43,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:43,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:43,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078985403] [2022-12-13 07:49:43,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:43,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:43,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:43,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:43,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:43,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 4918 transitions, 129961 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:43,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:43,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:43,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:49:53,819 INFO L130 PetriNetUnfolder]: 14047/20070 cut-off events. [2022-12-13 07:49:53,819 INFO L131 PetriNetUnfolder]: For 143542/143542 co-relation queries the response was YES. [2022-12-13 07:49:53,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267821 conditions, 20070 events. 14047/20070 cut-off events. For 143542/143542 co-relation queries the response was YES. Maximal size of possible extension queue 852. Compared 118148 event pairs, 164 based on Foata normal form. 244/15008 useless extension candidates. Maximal degree in co-relation 256647. Up to 16283 conditions per place. [2022-12-13 07:49:53,989 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 3878 selfloop transitions, 281 changer transitions 295/4483 dead transitions. [2022-12-13 07:49:53,990 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 4483 transitions, 127175 flow [2022-12-13 07:49:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:49:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:49:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-13 07:49:53,990 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2022-12-13 07:49:53,991 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2022-12-13 07:49:53,991 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 4483 transitions, 127175 flow [2022-12-13 07:49:54,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 4188 transitions, 118696 flow [2022-12-13 07:49:54,294 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:49:54,294 INFO L89 Accepts]: Start accepts. Operand has 92 places, 4188 transitions, 118696 flow [2022-12-13 07:49:54,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:49:54,315 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:49:54,315 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 4188 transitions, 118696 flow [2022-12-13 07:49:54,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 4188 transitions, 118696 flow [2022-12-13 07:49:54,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:49:54,422 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:49:54,422 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-13 07:49:54,422 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 4188 transitions, 118696 flow [2022-12-13 07:49:54,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:54,423 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:49:54,423 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:49:54,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 07:49:54,423 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:49:54,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:49:54,423 INFO L85 PathProgramCache]: Analyzing trace with hash 421377614, now seen corresponding path program 3 times [2022-12-13 07:49:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:49:54,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32508859] [2022-12-13 07:49:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:49:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:49:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:49:54,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:49:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:49:54,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32508859] [2022-12-13 07:49:54,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32508859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:49:54,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:49:54,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:49:54,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897654546] [2022-12-13 07:49:54,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:49:54,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:49:54,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:49:54,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:49:54,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:49:54,487 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:49:54,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 4188 transitions, 118696 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:49:54,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:49:54,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:49:54,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:04,182 INFO L130 PetriNetUnfolder]: 15469/22106 cut-off events. [2022-12-13 07:50:04,182 INFO L131 PetriNetUnfolder]: For 182478/182478 co-relation queries the response was YES. [2022-12-13 07:50:04,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317101 conditions, 22106 events. 15469/22106 cut-off events. For 182478/182478 co-relation queries the response was YES. Maximal size of possible extension queue 945. Compared 131744 event pairs, 168 based on Foata normal form. 146/16518 useless extension candidates. Maximal degree in co-relation 303590. Up to 18015 conditions per place. [2022-12-13 07:50:04,355 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 4551 selfloop transitions, 324 changer transitions 143/5072 dead transitions. [2022-12-13 07:50:04,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 5072 transitions, 153934 flow [2022-12-13 07:50:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:50:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:50:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2022-12-13 07:50:04,356 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6149425287356322 [2022-12-13 07:50:04,357 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 59 predicate places. [2022-12-13 07:50:04,357 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 5072 transitions, 153934 flow [2022-12-13 07:50:04,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 4929 transitions, 149593 flow [2022-12-13 07:50:04,711 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:04,712 INFO L89 Accepts]: Start accepts. Operand has 97 places, 4929 transitions, 149593 flow [2022-12-13 07:50:04,737 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:04,737 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:04,737 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 4929 transitions, 149593 flow [2022-12-13 07:50:04,852 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 4929 transitions, 149593 flow [2022-12-13 07:50:04,852 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:50:04,863 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:04,863 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-13 07:50:04,863 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 4929 transitions, 149593 flow [2022-12-13 07:50:04,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:50:04,864 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:04,864 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:04,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 07:50:04,864 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1074270514, now seen corresponding path program 4 times [2022-12-13 07:50:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:04,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575589711] [2022-12-13 07:50:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575589711] [2022-12-13 07:50:04,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575589711] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:04,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419389289] [2022-12-13 07:50:04,905 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:50:04,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:04,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:04,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:04,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 07:50:04,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:50:04,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:04,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:50:04,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:05,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:50:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:05,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419389289] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:05,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:05,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:50:05,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254517345] [2022-12-13 07:50:05,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:05,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:50:05,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:05,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:50:05,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:50:05,028 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:05,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 4929 transitions, 149593 flow. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:50:05,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:05,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:05,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:18,800 INFO L130 PetriNetUnfolder]: 16926/24015 cut-off events. [2022-12-13 07:50:18,801 INFO L131 PetriNetUnfolder]: For 224776/224776 co-relation queries the response was YES. [2022-12-13 07:50:18,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367453 conditions, 24015 events. 16926/24015 cut-off events. For 224776/224776 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 142626 event pairs, 176 based on Foata normal form. 110/17933 useless extension candidates. Maximal degree in co-relation 352735. Up to 20039 conditions per place. [2022-12-13 07:50:19,158 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 4857 selfloop transitions, 244 changer transitions 135/5290 dead transitions. [2022-12-13 07:50:19,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 5290 transitions, 171066 flow [2022-12-13 07:50:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:50:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:50:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2022-12-13 07:50:19,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 07:50:19,160 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-13 07:50:19,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 5290 transitions, 171066 flow [2022-12-13 07:50:19,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 5155 transitions, 166692 flow [2022-12-13 07:50:19,543 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:19,543 INFO L89 Accepts]: Start accepts. Operand has 104 places, 5155 transitions, 166692 flow [2022-12-13 07:50:19,570 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:19,570 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:19,570 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 5155 transitions, 166692 flow [2022-12-13 07:50:19,696 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 5155 transitions, 166692 flow [2022-12-13 07:50:19,696 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:50:19,707 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:19,707 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 164 [2022-12-13 07:50:19,707 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 5155 transitions, 166692 flow [2022-12-13 07:50:19,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:50:19,707 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:19,708 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:19,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-13 07:50:19,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 07:50:19,912 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:19,913 INFO L85 PathProgramCache]: Analyzing trace with hash 153209066, now seen corresponding path program 3 times [2022-12-13 07:50:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:19,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784311853] [2022-12-13 07:50:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:19,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784311853] [2022-12-13 07:50:19,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784311853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:19,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803301360] [2022-12-13 07:50:19,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:50:19,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:19,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:19,963 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:19,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 07:50:20,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:50:20,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:20,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:50:20,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:20,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:50:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:20,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803301360] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:50:20,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:50:20,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:50:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078461052] [2022-12-13 07:50:20,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:50:20,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:50:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:20,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:50:20,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:50:20,084 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:20,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 5155 transitions, 166692 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:50:20,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:20,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:20,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:36,798 INFO L130 PetriNetUnfolder]: 17715/25186 cut-off events. [2022-12-13 07:50:36,799 INFO L131 PetriNetUnfolder]: For 241059/241059 co-relation queries the response was YES. [2022-12-13 07:50:36,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410288 conditions, 25186 events. 17715/25186 cut-off events. For 241059/241059 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 150930 event pairs, 40 based on Foata normal form. 228/18980 useless extension candidates. Maximal degree in co-relation 393760. Up to 21217 conditions per place. [2022-12-13 07:50:37,004 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 5337 selfloop transitions, 261 changer transitions 287/5899 dead transitions. [2022-12-13 07:50:37,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 5899 transitions, 202515 flow [2022-12-13 07:50:37,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:50:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:50:37,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-12-13 07:50:37,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.593103448275862 [2022-12-13 07:50:37,005 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 70 predicate places. [2022-12-13 07:50:37,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 5899 transitions, 202515 flow [2022-12-13 07:50:37,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 5612 transitions, 192679 flow [2022-12-13 07:50:37,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:37,445 INFO L89 Accepts]: Start accepts. Operand has 108 places, 5612 transitions, 192679 flow [2022-12-13 07:50:37,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:37,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:37,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 5612 transitions, 192679 flow [2022-12-13 07:50:37,645 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 5612 transitions, 192679 flow [2022-12-13 07:50:37,645 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:50:37,656 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:37,656 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 212 [2022-12-13 07:50:37,656 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 5612 transitions, 192679 flow [2022-12-13 07:50:37,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:50:37,657 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:37,657 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:37,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 07:50:37,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 07:50:37,861 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:37,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:37,862 INFO L85 PathProgramCache]: Analyzing trace with hash 237791306, now seen corresponding path program 4 times [2022-12-13 07:50:37,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:37,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632586501] [2022-12-13 07:50:37,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:37,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:37,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:37,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632586501] [2022-12-13 07:50:37,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632586501] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:50:37,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:50:37,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:50:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743953551] [2022-12-13 07:50:37,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:50:37,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:50:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:50:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:50:37,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:50:37,935 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:50:37,935 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 5612 transitions, 192679 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:50:37,935 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:50:37,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:50:37,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:50:58,897 INFO L130 PetriNetUnfolder]: 19008/27155 cut-off events. [2022-12-13 07:50:58,897 INFO L131 PetriNetUnfolder]: For 262437/262437 co-relation queries the response was YES. [2022-12-13 07:50:58,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470845 conditions, 27155 events. 19008/27155 cut-off events. For 262437/262437 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 166517 event pairs, 36 based on Foata normal form. 434/20625 useless extension candidates. Maximal degree in co-relation 452741. Up to 22577 conditions per place. [2022-12-13 07:50:59,139 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 5784 selfloop transitions, 535 changer transitions 454/6787 dead transitions. [2022-12-13 07:50:59,139 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 6787 transitions, 246754 flow [2022-12-13 07:50:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:50:59,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:50:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-13 07:50:59,140 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5919540229885057 [2022-12-13 07:50:59,141 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 75 predicate places. [2022-12-13 07:50:59,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 6787 transitions, 246754 flow [2022-12-13 07:50:59,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 6333 transitions, 230110 flow [2022-12-13 07:50:59,627 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:50:59,627 INFO L89 Accepts]: Start accepts. Operand has 113 places, 6333 transitions, 230110 flow [2022-12-13 07:50:59,663 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:50:59,664 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:50:59,664 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 6333 transitions, 230110 flow [2022-12-13 07:50:59,848 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 6333 transitions, 230110 flow [2022-12-13 07:50:59,848 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:50:59,860 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:50:59,861 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 07:50:59,861 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 6333 transitions, 230110 flow [2022-12-13 07:50:59,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:50:59,861 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:50:59,861 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:50:59,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 07:50:59,861 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:50:59,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:50:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1157212210, now seen corresponding path program 5 times [2022-12-13 07:50:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:50:59,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436718943] [2022-12-13 07:50:59,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:50:59,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:50:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:50:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:50:59,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:50:59,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436718943] [2022-12-13 07:50:59,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436718943] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:50:59,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446007187] [2022-12-13 07:50:59,901 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:50:59,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:50:59,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:50:59,903 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:50:59,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 07:50:59,977 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:50:59,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:50:59,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:50:59,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:50:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:00,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:00,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446007187] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:00,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:00,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:51:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440319167] [2022-12-13 07:51:00,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:00,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:51:00,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:00,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:51:00,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:51:00,029 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:00,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 6333 transitions, 230110 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:00,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:00,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:00,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:23,049 INFO L130 PetriNetUnfolder]: 19488/27501 cut-off events. [2022-12-13 07:51:23,050 INFO L131 PetriNetUnfolder]: For 296888/296888 co-relation queries the response was YES. [2022-12-13 07:51:23,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502986 conditions, 27501 events. 19488/27501 cut-off events. For 296888/296888 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 164278 event pairs, 40 based on Foata normal form. 228/20759 useless extension candidates. Maximal degree in co-relation 484640. Up to 23431 conditions per place. [2022-12-13 07:51:23,286 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 5790 selfloop transitions, 412 changer transitions 355/6571 dead transitions. [2022-12-13 07:51:23,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 6571 transitions, 251816 flow [2022-12-13 07:51:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:51:23,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:51:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2022-12-13 07:51:23,287 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5905172413793104 [2022-12-13 07:51:23,287 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 82 predicate places. [2022-12-13 07:51:23,287 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 6571 transitions, 251816 flow [2022-12-13 07:51:23,590 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 6216 transitions, 238051 flow [2022-12-13 07:51:23,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:23,819 INFO L89 Accepts]: Start accepts. Operand has 120 places, 6216 transitions, 238051 flow [2022-12-13 07:51:23,869 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:23,869 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:23,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 6216 transitions, 238051 flow [2022-12-13 07:51:24,040 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 6216 transitions, 238051 flow [2022-12-13 07:51:24,040 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:24,052 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:24,053 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 235 [2022-12-13 07:51:24,053 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 6216 transitions, 238051 flow [2022-12-13 07:51:24,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:24,053 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:24,053 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:24,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:24,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 07:51:24,258 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:24,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:24,259 INFO L85 PathProgramCache]: Analyzing trace with hash -925158396, now seen corresponding path program 4 times [2022-12-13 07:51:24,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:24,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119815738] [2022-12-13 07:51:24,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:24,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:24,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:24,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:24,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119815738] [2022-12-13 07:51:24,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119815738] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:51:24,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364004499] [2022-12-13 07:51:24,321 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:51:24,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:24,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:51:24,322 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:51:24,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 07:51:24,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:51:24,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:51:24,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:51:24,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:51:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:24,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:51:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:24,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364004499] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:51:24,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:51:24,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:51:24,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635731122] [2022-12-13 07:51:24,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:51:24,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:51:24,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:24,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:51:24,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:51:24,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:24,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 6216 transitions, 238051 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:24,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:24,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:24,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:51:50,031 INFO L130 PetriNetUnfolder]: 20796/29113 cut-off events. [2022-12-13 07:51:50,032 INFO L131 PetriNetUnfolder]: For 338443/338443 co-relation queries the response was YES. [2022-12-13 07:51:50,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561483 conditions, 29113 events. 20796/29113 cut-off events. For 338443/338443 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 171673 event pairs, 0 based on Foata normal form. 168/21855 useless extension candidates. Maximal degree in co-relation 542682. Up to 25235 conditions per place. [2022-12-13 07:51:50,303 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 6499 selfloop transitions, 391 changer transitions 352/7256 dead transitions. [2022-12-13 07:51:50,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 7256 transitions, 292386 flow [2022-12-13 07:51:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:51:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:51:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-13 07:51:50,304 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5655172413793104 [2022-12-13 07:51:50,304 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2022-12-13 07:51:50,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 7256 transitions, 292386 flow [2022-12-13 07:51:50,644 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 6904 transitions, 278191 flow [2022-12-13 07:51:50,903 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:51:50,903 INFO L89 Accepts]: Start accepts. Operand has 124 places, 6904 transitions, 278191 flow [2022-12-13 07:51:50,987 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:51:50,987 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:51:50,987 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 6904 transitions, 278191 flow [2022-12-13 07:51:51,194 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 6904 transitions, 278191 flow [2022-12-13 07:51:51,194 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:51:51,209 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:51:51,209 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 306 [2022-12-13 07:51:51,209 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 6904 transitions, 278191 flow [2022-12-13 07:51:51,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:51,209 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:51:51,210 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:51:51,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-13 07:51:51,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:51:51,414 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:51:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:51:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1543996984, now seen corresponding path program 5 times [2022-12-13 07:51:51,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:51:51,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406105759] [2022-12-13 07:51:51,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:51:51,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:51:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:51:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:51:51,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:51:51,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406105759] [2022-12-13 07:51:51,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406105759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:51:51,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:51:51,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:51:51,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008395416] [2022-12-13 07:51:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:51:51,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:51:51,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:51:51,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:51:51,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:51:51,457 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:51:51,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 6904 transitions, 278191 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:51:51,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:51:51,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:51:51,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:52:23,814 INFO L130 PetriNetUnfolder]: 22779/31962 cut-off events. [2022-12-13 07:52:23,814 INFO L131 PetriNetUnfolder]: For 404365/404365 co-relation queries the response was YES. [2022-12-13 07:52:23,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649412 conditions, 31962 events. 22779/31962 cut-off events. For 404365/404365 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 192326 event pairs, 0 based on Foata normal form. 524/24530 useless extension candidates. Maximal degree in co-relation 627881. Up to 27585 conditions per place. [2022-12-13 07:52:24,100 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 7293 selfloop transitions, 509 changer transitions 511/8347 dead transitions. [2022-12-13 07:52:24,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 8347 transitions, 353218 flow [2022-12-13 07:52:24,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:52:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:52:24,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 07:52:24,102 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6275862068965518 [2022-12-13 07:52:24,102 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 90 predicate places. [2022-12-13 07:52:24,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 8347 transitions, 353218 flow [2022-12-13 07:52:24,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 7836 transitions, 331441 flow [2022-12-13 07:52:24,746 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:52:24,747 INFO L89 Accepts]: Start accepts. Operand has 128 places, 7836 transitions, 331441 flow [2022-12-13 07:52:24,815 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:52:24,816 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:52:24,816 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 7836 transitions, 331441 flow [2022-12-13 07:52:25,053 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 7836 transitions, 331441 flow [2022-12-13 07:52:25,053 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:52:25,069 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:52:25,070 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 324 [2022-12-13 07:52:25,070 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 7836 transitions, 331441 flow [2022-12-13 07:52:25,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:25,070 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:52:25,070 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:52:25,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 07:52:25,070 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:52:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:52:25,071 INFO L85 PathProgramCache]: Analyzing trace with hash -151507300, now seen corresponding path program 6 times [2022-12-13 07:52:25,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:52:25,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258844279] [2022-12-13 07:52:25,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:52:25,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:52:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:52:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:25,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:52:25,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258844279] [2022-12-13 07:52:25,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258844279] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:52:25,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906430522] [2022-12-13 07:52:25,113 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:52:25,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:52:25,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:52:25,114 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:52:25,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 07:52:25,210 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:52:25,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:52:25,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:52:25,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:52:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:25,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:52:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:52:25,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906430522] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:52:25,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:52:25,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:52:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115695683] [2022-12-13 07:52:25,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:52:25,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:52:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:52:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:52:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:52:25,256 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:52:25,256 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 7836 transitions, 331441 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:52:25,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:52:25,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:52:25,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:06,253 INFO L130 PetriNetUnfolder]: 23730/32971 cut-off events. [2022-12-13 07:53:06,253 INFO L131 PetriNetUnfolder]: For 461448/461448 co-relation queries the response was YES. [2022-12-13 07:53:06,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701859 conditions, 32971 events. 23730/32971 cut-off events. For 461448/461448 co-relation queries the response was YES. Maximal size of possible extension queue 1437. Compared 194800 event pairs, 0 based on Foata normal form. 68/24889 useless extension candidates. Maximal degree in co-relation 680131. Up to 28907 conditions per place. [2022-12-13 07:53:06,602 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 7756 selfloop transitions, 445 changer transitions 52/8267 dead transitions. [2022-12-13 07:53:06,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 8267 transitions, 366196 flow [2022-12-13 07:53:06,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:53:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:53:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 07:53:06,603 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 07:53:06,603 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2022-12-13 07:53:06,603 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 8267 transitions, 366196 flow [2022-12-13 07:53:07,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 8215 transitions, 363884 flow [2022-12-13 07:53:07,364 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:07,364 INFO L89 Accepts]: Start accepts. Operand has 132 places, 8215 transitions, 363884 flow [2022-12-13 07:53:07,446 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:07,446 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:07,446 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 8215 transitions, 363884 flow [2022-12-13 07:53:07,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 8215 transitions, 363884 flow [2022-12-13 07:53:07,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:53:07,720 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:53:07,720 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 356 [2022-12-13 07:53:07,721 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 8215 transitions, 363884 flow [2022-12-13 07:53:07,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:07,721 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:07,721 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:07,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 07:53:07,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 07:53:07,923 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:53:07,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:07,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1696360862, now seen corresponding path program 6 times [2022-12-13 07:53:07,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:07,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809545751] [2022-12-13 07:53:07,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:07,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:07,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809545751] [2022-12-13 07:53:07,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809545751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:53:07,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:53:07,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:53:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667232319] [2022-12-13 07:53:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:53:07,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:53:07,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:53:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:53:07,966 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:53:07,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 8215 transitions, 363884 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:07,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:07,966 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:53:07,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:53:52,673 INFO L130 PetriNetUnfolder]: 22958/32131 cut-off events. [2022-12-13 07:53:52,673 INFO L131 PetriNetUnfolder]: For 511384/511384 co-relation queries the response was YES. [2022-12-13 07:53:52,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 714285 conditions, 32131 events. 22958/32131 cut-off events. For 511384/511384 co-relation queries the response was YES. Maximal size of possible extension queue 1425. Compared 192536 event pairs, 0 based on Foata normal form. 418/24709 useless extension candidates. Maximal degree in co-relation 692598. Up to 28071 conditions per place. [2022-12-13 07:53:53,144 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 7146 selfloop transitions, 481 changer transitions 444/8085 dead transitions. [2022-12-13 07:53:53,144 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 8085 transitions, 374306 flow [2022-12-13 07:53:53,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:53:53,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:53:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-13 07:53:53,145 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2022-12-13 07:53:53,145 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 98 predicate places. [2022-12-13 07:53:53,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 8085 transitions, 374306 flow [2022-12-13 07:53:53,556 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 7641 transitions, 353585 flow [2022-12-13 07:53:53,870 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:53:53,871 INFO L89 Accepts]: Start accepts. Operand has 136 places, 7641 transitions, 353585 flow [2022-12-13 07:53:53,946 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:53:53,946 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:53:53,947 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 7641 transitions, 353585 flow [2022-12-13 07:53:54,211 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 7641 transitions, 353585 flow [2022-12-13 07:53:54,211 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:53:54,226 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:53:54,226 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 356 [2022-12-13 07:53:54,226 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 7641 transitions, 353585 flow [2022-12-13 07:53:54,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:54,226 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:53:54,226 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:53:54,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 07:53:54,227 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:53:54,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:53:54,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1679185530, now seen corresponding path program 7 times [2022-12-13 07:53:54,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:53:54,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110372744] [2022-12-13 07:53:54,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:53:54,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:53:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:54,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:53:54,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110372744] [2022-12-13 07:53:54,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110372744] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:53:54,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055036677] [2022-12-13 07:53:54,283 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 07:53:54,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:53:54,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:53:54,284 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:53:54,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 07:53:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:53:54,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:53:54,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:53:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:54,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:53:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:53:54,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055036677] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:53:54,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:53:54,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:53:54,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717971218] [2022-12-13 07:53:54,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:53:54,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:53:54,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:53:54,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:53:54,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:53:54,423 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:53:54,423 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 7641 transitions, 353585 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:53:54,423 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:53:54,423 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:53:54,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:54:33,646 INFO L130 PetriNetUnfolder]: 21316/29675 cut-off events. [2022-12-13 07:54:33,647 INFO L131 PetriNetUnfolder]: For 539151/539151 co-relation queries the response was YES. [2022-12-13 07:54:33,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687256 conditions, 29675 events. 21316/29675 cut-off events. For 539151/539151 co-relation queries the response was YES. Maximal size of possible extension queue 1296. Compared 173530 event pairs, 0 based on Foata normal form. 76/22897 useless extension candidates. Maximal degree in co-relation 667081. Up to 26275 conditions per place. [2022-12-13 07:54:33,959 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 6827 selfloop transitions, 398 changer transitions 60/7299 dead transitions. [2022-12-13 07:54:33,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 7299 transitions, 352255 flow [2022-12-13 07:54:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:54:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:54:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 07:54:33,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 07:54:33,960 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 102 predicate places. [2022-12-13 07:54:33,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 7299 transitions, 352255 flow [2022-12-13 07:54:34,356 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 7239 transitions, 349339 flow [2022-12-13 07:54:34,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:54:34,770 INFO L89 Accepts]: Start accepts. Operand has 140 places, 7239 transitions, 349339 flow [2022-12-13 07:54:34,814 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:54:34,814 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:54:34,815 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 7239 transitions, 349339 flow [2022-12-13 07:54:35,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 7239 transitions, 349339 flow [2022-12-13 07:54:35,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:54:35,048 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:54:35,048 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 279 [2022-12-13 07:54:35,049 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 7239 transitions, 349339 flow [2022-12-13 07:54:35,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:35,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:54:35,049 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:54:35,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 07:54:35,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:54:35,253 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:54:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:54:35,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1521968552, now seen corresponding path program 7 times [2022-12-13 07:54:35,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:54:35,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549503125] [2022-12-13 07:54:35,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:54:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:54:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:54:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:54:35,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:54:35,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549503125] [2022-12-13 07:54:35,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549503125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:54:35,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:54:35,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:54:35,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179309426] [2022-12-13 07:54:35,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:54:35,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:54:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:54:35,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:54:35,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:54:35,296 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:54:35,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 7239 transitions, 349339 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:54:35,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:54:35,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:54:35,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:55:17,410 INFO L130 PetriNetUnfolder]: 20346/28527 cut-off events. [2022-12-13 07:55:17,410 INFO L131 PetriNetUnfolder]: For 572140/572140 co-relation queries the response was YES. [2022-12-13 07:55:17,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687225 conditions, 28527 events. 20346/28527 cut-off events. For 572140/572140 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 168443 event pairs, 0 based on Foata normal form. 630/22513 useless extension candidates. Maximal degree in co-relation 667876. Up to 25139 conditions per place. [2022-12-13 07:55:17,708 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 5886 selfloop transitions, 497 changer transitions 648/7063 dead transitions. [2022-12-13 07:55:17,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 7063 transitions, 354463 flow [2022-12-13 07:55:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:55:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:55:17,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 07:55:17,709 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2022-12-13 07:55:17,709 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2022-12-13 07:55:17,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 7063 transitions, 354463 flow [2022-12-13 07:55:18,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 6415 transitions, 321863 flow [2022-12-13 07:55:18,464 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:55:18,465 INFO L89 Accepts]: Start accepts. Operand has 145 places, 6415 transitions, 321863 flow [2022-12-13 07:55:18,528 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:55:18,528 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:55:18,528 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 6415 transitions, 321863 flow [2022-12-13 07:55:18,734 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 6415 transitions, 321863 flow [2022-12-13 07:55:18,734 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:55:18,747 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:55:18,747 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-13 07:55:18,747 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 6415 transitions, 321863 flow [2022-12-13 07:55:18,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:18,747 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:55:18,747 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:55:18,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 07:55:18,748 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:55:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:55:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1960519276, now seen corresponding path program 8 times [2022-12-13 07:55:18,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:55:18,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727001145] [2022-12-13 07:55:18,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:55:18,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:55:18,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:18,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:18,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:55:18,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727001145] [2022-12-13 07:55:18,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727001145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:55:18,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:55:18,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:55:18,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021126055] [2022-12-13 07:55:18,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:55:18,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:55:18,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:55:18,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:55:18,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:55:18,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:55:18,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 6415 transitions, 321863 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:18,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:55:18,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:55:18,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:55:53,912 INFO L130 PetriNetUnfolder]: 20726/28939 cut-off events. [2022-12-13 07:55:53,912 INFO L131 PetriNetUnfolder]: For 617096/617096 co-relation queries the response was YES. [2022-12-13 07:55:53,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725687 conditions, 28939 events. 20726/28939 cut-off events. For 617096/617096 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 169673 event pairs, 0 based on Foata normal form. 456/22745 useless extension candidates. Maximal degree in co-relation 705782. Up to 25603 conditions per place. [2022-12-13 07:55:54,219 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 6315 selfloop transitions, 371 changer transitions 412/7150 dead transitions. [2022-12-13 07:55:54,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 7150 transitions, 373079 flow [2022-12-13 07:55:54,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:55:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:55:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2022-12-13 07:55:54,220 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6413793103448275 [2022-12-13 07:55:54,220 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 111 predicate places. [2022-12-13 07:55:54,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 7150 transitions, 373079 flow [2022-12-13 07:55:54,607 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 6738 transitions, 351454 flow [2022-12-13 07:55:54,971 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:55:54,971 INFO L89 Accepts]: Start accepts. Operand has 149 places, 6738 transitions, 351454 flow [2022-12-13 07:55:55,012 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:55:55,012 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:55:55,012 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 6738 transitions, 351454 flow [2022-12-13 07:55:55,223 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 6738 transitions, 351454 flow [2022-12-13 07:55:55,224 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:55:55,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:55:55,237 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 266 [2022-12-13 07:55:55,237 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 6738 transitions, 351454 flow [2022-12-13 07:55:55,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:55,237 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:55:55,237 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:55:55,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 07:55:55,237 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:55:55,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:55:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash 945843052, now seen corresponding path program 9 times [2022-12-13 07:55:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:55:55,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512424360] [2022-12-13 07:55:55,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:55:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:55:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:55:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:55,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:55:55,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512424360] [2022-12-13 07:55:55,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512424360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:55:55,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494433898] [2022-12-13 07:55:55,275 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 07:55:55,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:55:55,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:55:55,277 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:55:55,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 07:55:55,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 07:55:55,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:55:55,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:55:55,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:55:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:55,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:55:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:55:55,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494433898] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:55:55,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:55:55,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:55:55,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559885591] [2022-12-13 07:55:55,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:55:55,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:55:55,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:55:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:55:55,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:55:55,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:55:55,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 6738 transitions, 351454 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:55:55,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:55:55,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:55:55,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:56:32,591 INFO L130 PetriNetUnfolder]: 21541/29778 cut-off events. [2022-12-13 07:56:32,591 INFO L131 PetriNetUnfolder]: For 683560/683560 co-relation queries the response was YES. [2022-12-13 07:56:32,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775847 conditions, 29778 events. 21541/29778 cut-off events. For 683560/683560 co-relation queries the response was YES. Maximal size of possible extension queue 1278. Compared 171040 event pairs, 0 based on Foata normal form. 88/23064 useless extension candidates. Maximal degree in co-relation 755401. Up to 26669 conditions per place. [2022-12-13 07:56:32,967 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 6548 selfloop transitions, 441 changer transitions 90/7111 dead transitions. [2022-12-13 07:56:32,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 7111 transitions, 385107 flow [2022-12-13 07:56:32,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:56:32,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:56:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-12-13 07:56:32,974 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-13 07:56:32,974 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 115 predicate places. [2022-12-13 07:56:32,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 7111 transitions, 385107 flow [2022-12-13 07:56:33,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 7021 transitions, 380211 flow [2022-12-13 07:56:33,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:56:33,775 INFO L89 Accepts]: Start accepts. Operand has 153 places, 7021 transitions, 380211 flow [2022-12-13 07:56:33,820 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:56:33,821 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:56:33,821 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 7021 transitions, 380211 flow [2022-12-13 07:56:34,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 7021 transitions, 380211 flow [2022-12-13 07:56:34,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:56:34,064 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:56:34,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 289 [2022-12-13 07:56:34,064 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 7021 transitions, 380211 flow [2022-12-13 07:56:34,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:56:34,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:56:34,065 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:56:34,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 07:56:34,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 07:56:34,268 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:56:34,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:56:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1180474097, now seen corresponding path program 6 times [2022-12-13 07:56:34,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:56:34,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755844457] [2022-12-13 07:56:34,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:56:34,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:56:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:56:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:56:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:56:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755844457] [2022-12-13 07:56:34,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755844457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:56:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084653443] [2022-12-13 07:56:34,313 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 07:56:34,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:56:34,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:56:34,314 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:56:34,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 07:56:34,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-13 07:56:34,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:56:34,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:56:34,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:56:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:56:34,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:56:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:56:34,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084653443] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:56:34,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:56:34,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:56:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528192609] [2022-12-13 07:56:34,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:56:34,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:56:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:56:34,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:56:34,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:56:34,466 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:56:34,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 7021 transitions, 380211 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:56:34,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:56:34,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:56:34,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:57:12,557 INFO L130 PetriNetUnfolder]: 20995/29120 cut-off events. [2022-12-13 07:57:12,558 INFO L131 PetriNetUnfolder]: For 738951/738951 co-relation queries the response was YES. [2022-12-13 07:57:12,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786116 conditions, 29120 events. 20995/29120 cut-off events. For 738951/738951 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 168152 event pairs, 0 based on Foata normal form. 146/22772 useless extension candidates. Maximal degree in co-relation 764929. Up to 26027 conditions per place. [2022-12-13 07:57:12,889 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 6362 selfloop transitions, 470 changer transitions 127/6987 dead transitions. [2022-12-13 07:57:12,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 6987 transitions, 392291 flow [2022-12-13 07:57:12,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:57:12,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:57:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2022-12-13 07:57:12,898 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2022-12-13 07:57:12,899 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 119 predicate places. [2022-12-13 07:57:12,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 6987 transitions, 392291 flow [2022-12-13 07:57:13,322 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 6860 transitions, 385134 flow [2022-12-13 07:57:13,753 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:57:13,753 INFO L89 Accepts]: Start accepts. Operand has 157 places, 6860 transitions, 385134 flow [2022-12-13 07:57:13,798 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:57:13,798 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:57:13,799 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 6860 transitions, 385134 flow [2022-12-13 07:57:14,025 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 6860 transitions, 385134 flow [2022-12-13 07:57:14,025 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:57:14,039 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:57:14,039 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 286 [2022-12-13 07:57:14,039 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 6860 transitions, 385134 flow [2022-12-13 07:57:14,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:14,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:14,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:57:14,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 07:57:14,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 07:57:14,240 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:57:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:14,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1606861617, now seen corresponding path program 7 times [2022-12-13 07:57:14,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:14,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21868242] [2022-12-13 07:57:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:14,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:14,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21868242] [2022-12-13 07:57:14,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21868242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:57:14,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:57:14,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:57:14,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688352943] [2022-12-13 07:57:14,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:57:14,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:57:14,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:14,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:57:14,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:57:14,279 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:57:14,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 6860 transitions, 385134 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:14,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:14,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:57:14,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:57:57,499 INFO L130 PetriNetUnfolder]: 19415/26880 cut-off events. [2022-12-13 07:57:57,500 INFO L131 PetriNetUnfolder]: For 763258/763258 co-relation queries the response was YES. [2022-12-13 07:57:57,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750471 conditions, 26880 events. 19415/26880 cut-off events. For 763258/763258 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 152770 event pairs, 0 based on Foata normal form. 364/21394 useless extension candidates. Maximal degree in co-relation 731896. Up to 23881 conditions per place. [2022-12-13 07:57:57,805 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 5557 selfloop transitions, 474 changer transitions 318/6373 dead transitions. [2022-12-13 07:57:57,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 6373 transitions, 370293 flow [2022-12-13 07:57:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:57:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:57:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-13 07:57:57,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6137931034482759 [2022-12-13 07:57:57,807 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2022-12-13 07:57:57,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 6373 transitions, 370293 flow [2022-12-13 07:57:58,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 6055 transitions, 351759 flow [2022-12-13 07:57:58,623 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:57:58,624 INFO L89 Accepts]: Start accepts. Operand has 159 places, 6055 transitions, 351759 flow [2022-12-13 07:57:58,668 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:57:58,668 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:57:58,668 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 6055 transitions, 351759 flow [2022-12-13 07:57:58,863 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 6055 transitions, 351759 flow [2022-12-13 07:57:58,863 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:57:58,875 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:57:58,876 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 253 [2022-12-13 07:57:58,876 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 6055 transitions, 351759 flow [2022-12-13 07:57:58,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:58,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:57:58,876 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:57:58,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 07:57:58,876 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:57:58,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:57:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1095680020, now seen corresponding path program 10 times [2022-12-13 07:57:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:57:58,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494350316] [2022-12-13 07:57:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:57:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:57:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:57:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:58,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:57:58,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494350316] [2022-12-13 07:57:58,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494350316] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:57:58,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507147523] [2022-12-13 07:57:58,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 07:57:58,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:57:58,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:57:58,913 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:57:58,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 07:57:58,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 07:57:58,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:57:58,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:57:58,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:57:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:59,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:57:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:57:59,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507147523] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:57:59,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:57:59,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 07:57:59,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366961449] [2022-12-13 07:57:59,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:57:59,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:57:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:57:59,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:57:59,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:57:59,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:57:59,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 6055 transitions, 351759 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:57:59,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:57:59,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:57:59,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:58:35,679 INFO L130 PetriNetUnfolder]: 20276/27781 cut-off events. [2022-12-13 07:58:35,679 INFO L131 PetriNetUnfolder]: For 853848/853848 co-relation queries the response was YES. [2022-12-13 07:58:35,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802491 conditions, 27781 events. 20276/27781 cut-off events. For 853848/853848 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 155081 event pairs, 0 based on Foata normal form. 168/22019 useless extension candidates. Maximal degree in co-relation 785097. Up to 24847 conditions per place. [2022-12-13 07:58:36,012 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 5792 selfloop transitions, 325 changer transitions 220/6369 dead transitions. [2022-12-13 07:58:36,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 6369 transitions, 382476 flow [2022-12-13 07:58:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:58:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:58:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-12-13 07:58:36,013 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-13 07:58:36,014 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 125 predicate places. [2022-12-13 07:58:36,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 6369 transitions, 382476 flow [2022-12-13 07:58:36,420 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 6149 transitions, 369351 flow [2022-12-13 07:58:36,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:58:36,791 INFO L89 Accepts]: Start accepts. Operand has 163 places, 6149 transitions, 369351 flow [2022-12-13 07:58:36,836 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:58:36,836 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:58:36,839 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 6149 transitions, 369351 flow [2022-12-13 07:58:37,042 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 6149 transitions, 369351 flow [2022-12-13 07:58:37,043 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:58:37,054 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:58:37,055 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 265 [2022-12-13 07:58:37,055 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 6149 transitions, 369351 flow [2022-12-13 07:58:37,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:37,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:58:37,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:58:37,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 07:58:37,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 07:58:37,260 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:58:37,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:58:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 563791468, now seen corresponding path program 11 times [2022-12-13 07:58:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:58:37,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037189832] [2022-12-13 07:58:37,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:58:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:58:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:58:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:37,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:58:37,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037189832] [2022-12-13 07:58:37,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037189832] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:58:37,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738356509] [2022-12-13 07:58:37,308 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:58:37,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:58:37,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:58:37,312 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:58:37,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 07:58:37,412 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:58:37,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:58:37,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:58:37,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:58:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:37,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:58:37,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:58:37,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738356509] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:58:37,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:58:37,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:58:37,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722674773] [2022-12-13 07:58:37,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:58:37,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:58:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:58:37,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:58:37,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:58:37,464 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:58:37,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 6149 transitions, 369351 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:58:37,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:58:37,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:58:37,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:13,349 INFO L130 PetriNetUnfolder]: 19870/26897 cut-off events. [2022-12-13 07:59:13,349 INFO L131 PetriNetUnfolder]: For 925338/925338 co-relation queries the response was YES. [2022-12-13 07:59:13,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801833 conditions, 26897 events. 19870/26897 cut-off events. For 925338/925338 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 145858 event pairs, 0 based on Foata normal form. 208/21593 useless extension candidates. Maximal degree in co-relation 789496. Up to 23989 conditions per place. [2022-12-13 07:59:13,724 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 5162 selfloop transitions, 530 changer transitions 327/6048 dead transitions. [2022-12-13 07:59:13,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 6048 transitions, 375160 flow [2022-12-13 07:59:13,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:59:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:59:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2022-12-13 07:59:13,724 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5301724137931034 [2022-12-13 07:59:13,725 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 131 predicate places. [2022-12-13 07:59:13,725 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 6048 transitions, 375160 flow [2022-12-13 07:59:14,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 5721 transitions, 354841 flow [2022-12-13 07:59:14,510 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:59:14,510 INFO L89 Accepts]: Start accepts. Operand has 166 places, 5721 transitions, 354841 flow [2022-12-13 07:59:14,558 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:59:14,558 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:14,558 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 5721 transitions, 354841 flow [2022-12-13 07:59:14,744 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 5721 transitions, 354841 flow [2022-12-13 07:59:14,744 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:59:14,756 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:59:14,756 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 246 [2022-12-13 07:59:14,756 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 5721 transitions, 354841 flow [2022-12-13 07:59:14,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:14,757 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:14,757 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:14,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 07:59:14,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:14,957 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:59:14,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:14,958 INFO L85 PathProgramCache]: Analyzing trace with hash -908856454, now seen corresponding path program 5 times [2022-12-13 07:59:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:14,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248299025] [2022-12-13 07:59:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:14,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:15,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:15,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248299025] [2022-12-13 07:59:15,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248299025] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:59:15,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123559116] [2022-12-13 07:59:15,011 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 07:59:15,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:15,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:59:15,013 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 07:59:15,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 07:59:15,102 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:59:15,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:59:15,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 07:59:15,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:59:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:15,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:59:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:15,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123559116] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:59:15,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:59:15,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 07:59:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588639018] [2022-12-13 07:59:15,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:59:15,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:59:15,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:15,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:59:15,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:59:15,149 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:59:15,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 5721 transitions, 354841 flow. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:15,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:15,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:59:15,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:59:46,529 INFO L130 PetriNetUnfolder]: 18790/25425 cut-off events. [2022-12-13 07:59:46,529 INFO L131 PetriNetUnfolder]: For 954179/954179 co-relation queries the response was YES. [2022-12-13 07:59:46,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781505 conditions, 25425 events. 18790/25425 cut-off events. For 954179/954179 co-relation queries the response was YES. Maximal size of possible extension queue 1056. Compared 136269 event pairs, 0 based on Foata normal form. 264/20615 useless extension candidates. Maximal degree in co-relation 768897. Up to 22653 conditions per place. [2022-12-13 07:59:46,876 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 4812 selfloop transitions, 507 changer transitions 301/5668 dead transitions. [2022-12-13 07:59:46,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 5668 transitions, 362795 flow [2022-12-13 07:59:46,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:59:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:59:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-13 07:59:46,877 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2022-12-13 07:59:46,878 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 132 predicate places. [2022-12-13 07:59:46,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 5668 transitions, 362795 flow [2022-12-13 07:59:47,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 5367 transitions, 343396 flow [2022-12-13 07:59:47,589 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:59:47,589 INFO L89 Accepts]: Start accepts. Operand has 170 places, 5367 transitions, 343396 flow [2022-12-13 07:59:47,630 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:59:47,630 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:59:47,631 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 5367 transitions, 343396 flow [2022-12-13 07:59:47,829 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 5367 transitions, 343396 flow [2022-12-13 07:59:47,829 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:59:47,840 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:59:47,841 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 252 [2022-12-13 07:59:47,841 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 5367 transitions, 343396 flow [2022-12-13 07:59:47,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:47,841 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:59:47,841 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:59:47,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 07:59:48,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:59:48,043 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 07:59:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:59:48,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1879947170, now seen corresponding path program 6 times [2022-12-13 07:59:48,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:59:48,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828221677] [2022-12-13 07:59:48,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:59:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:59:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:59:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:59:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:59:48,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828221677] [2022-12-13 07:59:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828221677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:59:48,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:59:48,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:59:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989904784] [2022-12-13 07:59:48,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:59:48,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:59:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:59:48,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:59:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:59:48,083 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 07:59:48,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 5367 transitions, 343396 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 07:59:48,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:59:48,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 07:59:48,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:00:13,193 INFO L130 PetriNetUnfolder]: 17124/22733 cut-off events. [2022-12-13 08:00:13,193 INFO L131 PetriNetUnfolder]: For 945963/945963 co-relation queries the response was YES. [2022-12-13 08:00:13,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718972 conditions, 22733 events. 17124/22733 cut-off events. For 945963/945963 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 114916 event pairs, 0 based on Foata normal form. 440/18457 useless extension candidates. Maximal degree in co-relation 712088. Up to 20105 conditions per place. [2022-12-13 08:00:13,495 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 3451 selfloop transitions, 395 changer transitions 651/4527 dead transitions. [2022-12-13 08:00:13,495 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 4527 transitions, 298108 flow [2022-12-13 08:00:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:00:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:00:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-13 08:00:13,496 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5379310344827586 [2022-12-13 08:00:13,496 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 136 predicate places. [2022-12-13 08:00:13,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 4527 transitions, 298108 flow [2022-12-13 08:00:13,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 3876 transitions, 255500 flow [2022-12-13 08:00:14,260 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:00:14,260 INFO L89 Accepts]: Start accepts. Operand has 155 places, 3876 transitions, 255500 flow [2022-12-13 08:00:14,296 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:00:14,296 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:00:14,296 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 3876 transitions, 255500 flow [2022-12-13 08:00:14,419 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 3876 transitions, 255500 flow [2022-12-13 08:00:14,419 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:00:14,429 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:00:14,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 169 [2022-12-13 08:00:14,429 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 3876 transitions, 255500 flow [2022-12-13 08:00:14,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:14,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:00:14,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:00:14,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 08:00:14,430 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:00:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:00:14,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1291466835, now seen corresponding path program 1 times [2022-12-13 08:00:14,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:00:14,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125541668] [2022-12-13 08:00:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:00:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:00:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:00:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:14,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:00:14,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125541668] [2022-12-13 08:00:14,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125541668] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:00:14,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666654321] [2022-12-13 08:00:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:00:14,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:00:14,486 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:00:14,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 08:00:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:00:14,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 08:00:14,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:00:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:14,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:00:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:14,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666654321] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:00:14,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:00:14,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-12-13 08:00:14,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727927190] [2022-12-13 08:00:14,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:00:14,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 08:00:14,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:00:14,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 08:00:14,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 08:00:14,639 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 08:00:14,639 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 3876 transitions, 255500 flow. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:14,639 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:00:14,639 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 08:00:14,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:00:33,877 INFO L130 PetriNetUnfolder]: 17053/22258 cut-off events. [2022-12-13 08:00:33,877 INFO L131 PetriNetUnfolder]: For 959850/959850 co-relation queries the response was YES. [2022-12-13 08:00:33,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 727464 conditions, 22258 events. 17053/22258 cut-off events. For 959850/959850 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 106684 event pairs, 0 based on Foata normal form. 0/17730 useless extension candidates. Maximal degree in co-relation 720091. Up to 20423 conditions per place. [2022-12-13 08:00:34,302 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 3720 selfloop transitions, 387 changer transitions 0/4137 dead transitions. [2022-12-13 08:00:34,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 4137 transitions, 280905 flow [2022-12-13 08:00:34,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 08:00:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 08:00:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 08:00:34,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5448275862068965 [2022-12-13 08:00:34,303 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 121 predicate places. [2022-12-13 08:00:34,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 4137 transitions, 280905 flow [2022-12-13 08:00:34,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 4137 transitions, 280905 flow [2022-12-13 08:00:34,902 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:00:34,902 INFO L89 Accepts]: Start accepts. Operand has 159 places, 4137 transitions, 280905 flow [2022-12-13 08:00:34,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:00:34,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:00:34,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 4137 transitions, 280905 flow [2022-12-13 08:00:35,126 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 4137 transitions, 280905 flow [2022-12-13 08:00:35,126 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:00:35,135 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:00:35,136 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 234 [2022-12-13 08:00:35,136 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 4137 transitions, 280905 flow [2022-12-13 08:00:35,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:35,136 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:00:35,136 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:00:35,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 08:00:35,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:35,337 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:00:35,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:00:35,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1617657711, now seen corresponding path program 2 times [2022-12-13 08:00:35,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:00:35,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928928708] [2022-12-13 08:00:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:00:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:00:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:00:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:35,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:00:35,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928928708] [2022-12-13 08:00:35,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928928708] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:00:35,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228986195] [2022-12-13 08:00:35,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:00:35,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:35,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:00:35,380 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:00:35,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 08:00:35,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:00:35,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:00:35,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 08:00:35,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:00:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:35,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:00:35,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:35,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228986195] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:00:35,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:00:35,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 08:00:35,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412026624] [2022-12-13 08:00:35,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:00:35,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 08:00:35,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:00:35,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 08:00:35,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 08:00:35,541 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-13 08:00:35,541 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 4137 transitions, 280905 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:35,541 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:00:35,541 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-13 08:00:35,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:00:57,637 INFO L130 PetriNetUnfolder]: 19007/24768 cut-off events. [2022-12-13 08:00:57,637 INFO L131 PetriNetUnfolder]: For 1048943/1048943 co-relation queries the response was YES. [2022-12-13 08:00:57,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835215 conditions, 24768 events. 19007/24768 cut-off events. For 1048943/1048943 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 119903 event pairs, 0 based on Foata normal form. 0/19766 useless extension candidates. Maximal degree in co-relation 827193. Up to 22821 conditions per place. [2022-12-13 08:00:58,001 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 4225 selfloop transitions, 464 changer transitions 0/4707 dead transitions. [2022-12-13 08:00:58,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 4707 transitions, 328756 flow [2022-12-13 08:00:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 08:00:58,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 08:00:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2022-12-13 08:00:58,002 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4559386973180077 [2022-12-13 08:00:58,002 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 129 predicate places. [2022-12-13 08:00:58,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 4707 transitions, 328756 flow [2022-12-13 08:00:58,498 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 4707 transitions, 328756 flow [2022-12-13 08:00:58,796 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:00:58,796 INFO L89 Accepts]: Start accepts. Operand has 167 places, 4707 transitions, 328756 flow [2022-12-13 08:00:58,922 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:00:58,923 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:00:58,923 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 4707 transitions, 328756 flow [2022-12-13 08:00:59,075 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 4707 transitions, 328756 flow [2022-12-13 08:00:59,076 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:00:59,086 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:00:59,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 291 [2022-12-13 08:00:59,087 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 4707 transitions, 328756 flow [2022-12-13 08:00:59,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:59,087 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:00:59,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:00:59,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 08:00:59,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 08:00:59,288 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:00:59,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:00:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1181029613, now seen corresponding path program 3 times [2022-12-13 08:00:59,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:00:59,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817734060] [2022-12-13 08:00:59,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:00:59,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:00:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:00:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:59,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:00:59,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817734060] [2022-12-13 08:00:59,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817734060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:00:59,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645718461] [2022-12-13 08:00:59,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 08:00:59,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:00:59,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:00:59,336 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:00:59,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 08:00:59,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-13 08:00:59,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:00:59,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 08:00:59,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:00:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:59,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:00:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:00:59,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645718461] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:00:59,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:00:59,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-12-13 08:00:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416076768] [2022-12-13 08:00:59,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:00:59,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 08:00:59,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:00:59,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 08:00:59,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-13 08:00:59,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-13 08:00:59,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 4707 transitions, 328756 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:00:59,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:00:59,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-13 08:00:59,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:01:26,572 INFO L130 PetriNetUnfolder]: 19409/25224 cut-off events. [2022-12-13 08:01:26,573 INFO L131 PetriNetUnfolder]: For 1020633/1020633 co-relation queries the response was YES. [2022-12-13 08:01:26,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 874765 conditions, 25224 events. 19409/25224 cut-off events. For 1020633/1020633 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 121771 event pairs, 0 based on Foata normal form. 0/20272 useless extension candidates. Maximal degree in co-relation 867451. Up to 23201 conditions per place. [2022-12-13 08:01:27,046 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 3962 selfloop transitions, 907 changer transitions 0/4887 dead transitions. [2022-12-13 08:01:27,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 4887 transitions, 350005 flow [2022-12-13 08:01:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 08:01:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 08:01:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 196 transitions. [2022-12-13 08:01:27,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45057471264367815 [2022-12-13 08:01:27,048 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 139 predicate places. [2022-12-13 08:01:27,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 4887 transitions, 350005 flow [2022-12-13 08:01:27,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 177 places, 4887 transitions, 350005 flow [2022-12-13 08:01:27,900 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:01:27,900 INFO L89 Accepts]: Start accepts. Operand has 177 places, 4887 transitions, 350005 flow [2022-12-13 08:01:27,968 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:01:27,969 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:01:27,969 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 4887 transitions, 350005 flow [2022-12-13 08:01:28,130 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 177 places, 4887 transitions, 350005 flow [2022-12-13 08:01:28,130 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:01:28,142 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:01:28,142 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-13 08:01:28,142 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 4887 transitions, 350005 flow [2022-12-13 08:01:28,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:01:28,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:01:28,143 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:01:28,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 08:01:28,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:01:28,348 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:01:28,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:01:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1668706103, now seen corresponding path program 1 times [2022-12-13 08:01:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:01:28,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840590006] [2022-12-13 08:01:28,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:01:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:01:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:01:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:28,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:01:28,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840590006] [2022-12-13 08:01:28,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840590006] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:01:28,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259306001] [2022-12-13 08:01:28,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:01:28,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:01:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:01:28,519 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:01:28,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 08:01:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:01:28,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-13 08:01:28,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:01:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:28,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:01:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 08:01:28,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259306001] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:01:28,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:01:28,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-12-13 08:01:28,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292307029] [2022-12-13 08:01:28,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:01:28,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 08:01:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:01:28,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 08:01:28,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 08:01:28,816 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-13 08:01:28,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 4887 transitions, 350005 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:01:28,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:01:28,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-13 08:01:28,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 08:02:07,336 INFO L130 PetriNetUnfolder]: 29869/39528 cut-off events. [2022-12-13 08:02:07,336 INFO L131 PetriNetUnfolder]: For 1366300/1366300 co-relation queries the response was YES. [2022-12-13 08:02:07,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1418923 conditions, 39528 events. 29869/39528 cut-off events. For 1366300/1366300 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 210681 event pairs, 0 based on Foata normal form. 1192/31860 useless extension candidates. Maximal degree in co-relation 1404957. Up to 36835 conditions per place. [2022-12-13 08:02:08,015 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 4898 selfloop transitions, 1282 changer transitions 12/6262 dead transitions. [2022-12-13 08:02:08,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 6262 transitions, 463181 flow [2022-12-13 08:02:08,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 08:02:08,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 08:02:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2022-12-13 08:02:08,017 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.771551724137931 [2022-12-13 08:02:08,017 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 144 predicate places. [2022-12-13 08:02:08,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 6262 transitions, 463181 flow [2022-12-13 08:02:08,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 6250 transitions, 462272 flow [2022-12-13 08:02:09,354 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 08:02:09,354 INFO L89 Accepts]: Start accepts. Operand has 182 places, 6250 transitions, 462272 flow [2022-12-13 08:02:09,487 INFO L95 Accepts]: Finished accepts. [2022-12-13 08:02:09,487 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 08:02:09,487 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 6250 transitions, 462272 flow [2022-12-13 08:02:09,736 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 6250 transitions, 462272 flow [2022-12-13 08:02:09,737 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 08:02:09,753 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 08:02:09,753 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 399 [2022-12-13 08:02:09,753 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 6250 transitions, 462272 flow [2022-12-13 08:02:09,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:02:09,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 08:02:09,754 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 08:02:09,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 08:02:09,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:02:09,958 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 08:02:09,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 08:02:09,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2140324079, now seen corresponding path program 2 times [2022-12-13 08:02:09,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 08:02:09,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543365909] [2022-12-13 08:02:09,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 08:02:09,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 08:02:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 08:02:10,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:02:10,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 08:02:10,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543365909] [2022-12-13 08:02:10,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543365909] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 08:02:10,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145761695] [2022-12-13 08:02:10,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 08:02:10,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:02:10,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 08:02:10,087 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 08:02:10,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 08:02:10,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 08:02:10,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 08:02:10,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 08:02:10,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 08:02:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:02:10,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 08:02:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 08:02:10,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145761695] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 08:02:10,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 08:02:10,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-12-13 08:02:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041165546] [2022-12-13 08:02:10,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 08:02:10,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 08:02:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 08:02:10,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 08:02:10,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-12-13 08:02:10,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-13 08:02:10,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 6250 transitions, 462272 flow. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 08:02:10,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 08:02:10,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-13 08:02:10,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 08:02:59,336 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:02:59,336 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 08:02:59,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 08:02:59,343 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 08:02:59,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-12-13 08:02:59,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 08:02:59,545 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 2/29 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 1053212 conditions, 28818 events (21986/28817 cut-off events. For 1154134/1154134 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 161012 event pairs, 0 based on Foata normal form. 0/24113 useless extension candidates. Maximal degree in co-relation 1052097. Up to 26330 conditions per place.). [2022-12-13 08:02:59,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 08:02:59,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 08:02:59,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 08:02:59,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 08:02:59,547 INFO L445 BasicCegarLoop]: Path program histogram: [11, 7, 7, 6, 3, 2, 1] [2022-12-13 08:02:59,550 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 08:02:59,550 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 08:02:59,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:02:59 BasicIcfg [2022-12-13 08:02:59,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 08:02:59,552 INFO L158 Benchmark]: Toolchain (without parser) took 838698.31ms. Allocated memory was 220.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 196.2MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2022-12-13 08:02:59,552 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 196.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 08:02:59,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.32ms. Allocated memory is still 220.2MB. Free memory was 196.2MB in the beginning and 183.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 08:02:59,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.98ms. Allocated memory is still 220.2MB. Free memory was 183.3MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 08:02:59,553 INFO L158 Benchmark]: Boogie Preprocessor took 34.43ms. Allocated memory is still 220.2MB. Free memory was 181.8MB in the beginning and 180.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 08:02:59,553 INFO L158 Benchmark]: RCFGBuilder took 402.05ms. Allocated memory is still 220.2MB. Free memory was 180.2MB in the beginning and 161.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 08:02:59,553 INFO L158 Benchmark]: TraceAbstraction took 837997.01ms. Allocated memory was 220.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 160.8MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2022-12-13 08:02:59,555 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 196.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.32ms. Allocated memory is still 220.2MB. Free memory was 196.2MB in the beginning and 183.3MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.98ms. Allocated memory is still 220.2MB. Free memory was 183.3MB in the beginning and 181.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.43ms. Allocated memory is still 220.2MB. Free memory was 181.8MB in the beginning and 180.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 402.05ms. Allocated memory is still 220.2MB. Free memory was 180.2MB in the beginning and 161.8MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 837997.01ms. Allocated memory was 220.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 160.8MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 107 PlacesBefore, 38 PlacesAfterwards, 103 TransitionsBefore, 29 TransitionsAfterwards, 2520 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 41 ConcurrentYvCompositions, 5 ChoiceCompositions, 74 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1352, independent: 1349, independent conditional: 1349, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1352, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1352, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1352, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1352, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1352, independent: 1346, independent conditional: 0, independent unconditional: 1346, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1352, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1352, unknown conditional: 0, unknown unconditional: 1352] , Statistics on independence cache: Total cache size (in pairs): 2163, Positive cache size: 2160, Positive conditional cache size: 0, Positive unconditional cache size: 2160, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 374 TransitionsBefore, 374 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 901 TransitionsBefore, 901 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 1825 TransitionsBefore, 1825 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 2087 TransitionsBefore, 2087 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 2441 TransitionsBefore, 2441 TransitionsAfterwards, 16 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 2690 TransitionsBefore, 2690 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 72 PlacesBefore, 72 PlacesAfterwards, 3028 TransitionsBefore, 3028 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 3261 TransitionsBefore, 3261 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 3548 TransitionsBefore, 3548 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 4918 TransitionsBefore, 4918 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 92 PlacesBefore, 92 PlacesAfterwards, 4188 TransitionsBefore, 4188 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 97 PlacesBefore, 97 PlacesAfterwards, 4929 TransitionsBefore, 4929 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 104 PlacesBefore, 104 PlacesAfterwards, 5155 TransitionsBefore, 5155 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 108 PlacesBefore, 108 PlacesAfterwards, 5612 TransitionsBefore, 5612 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 113 PlacesBefore, 113 PlacesAfterwards, 6333 TransitionsBefore, 6333 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 120 PlacesBefore, 120 PlacesAfterwards, 6216 TransitionsBefore, 6216 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 124 PlacesBefore, 124 PlacesAfterwards, 6904 TransitionsBefore, 6904 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 128 PlacesBefore, 128 PlacesAfterwards, 7836 TransitionsBefore, 7836 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 132 PlacesBefore, 132 PlacesAfterwards, 8215 TransitionsBefore, 8215 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 136 PlacesBefore, 136 PlacesAfterwards, 7641 TransitionsBefore, 7641 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 140 PlacesBefore, 140 PlacesAfterwards, 7239 TransitionsBefore, 7239 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 145 PlacesBefore, 145 PlacesAfterwards, 6415 TransitionsBefore, 6415 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 149 PlacesBefore, 149 PlacesAfterwards, 6738 TransitionsBefore, 6738 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 153 PlacesBefore, 153 PlacesAfterwards, 7021 TransitionsBefore, 7021 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 157 PlacesBefore, 157 PlacesAfterwards, 6860 TransitionsBefore, 6860 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 159 PlacesBefore, 159 PlacesAfterwards, 6055 TransitionsBefore, 6055 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 163 PlacesBefore, 163 PlacesAfterwards, 6149 TransitionsBefore, 6149 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 166 PlacesBefore, 166 PlacesAfterwards, 5721 TransitionsBefore, 5721 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 170 PlacesBefore, 170 PlacesAfterwards, 5367 TransitionsBefore, 5367 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 155 PlacesBefore, 155 PlacesAfterwards, 3876 TransitionsBefore, 3876 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 159 PlacesBefore, 159 PlacesAfterwards, 4137 TransitionsBefore, 4137 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 167 PlacesBefore, 167 PlacesAfterwards, 4707 TransitionsBefore, 4707 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 177 PlacesBefore, 177 PlacesAfterwards, 4887 TransitionsBefore, 4887 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 182 PlacesBefore, 182 PlacesAfterwards, 6250 TransitionsBefore, 6250 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 2/29 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 1053212 conditions, 28818 events (21986/28817 cut-off events. For 1154134/1154134 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 161012 event pairs, 0 based on Foata normal form. 0/24113 useless extension candidates. Maximal degree in co-relation 1052097. Up to 26330 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 2/29 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 1053212 conditions, 28818 events (21986/28817 cut-off events. For 1154134/1154134 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 161012 event pairs, 0 based on Foata normal form. 0/24113 useless extension candidates. Maximal degree in co-relation 1052097. Up to 26330 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 2/29 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 1053212 conditions, 28818 events (21986/28817 cut-off events. For 1154134/1154134 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 161012 event pairs, 0 based on Foata normal form. 0/24113 useless extension candidates. Maximal degree in co-relation 1052097. Up to 26330 conditions per place.). - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 2/29 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 1053212 conditions, 28818 events (21986/28817 cut-off events. For 1154134/1154134 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 161012 event pairs, 0 based on Foata normal form. 0/24113 useless extension candidates. Maximal degree in co-relation 1052097. Up to 26330 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 2/29 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 1053212 conditions, 28818 events (21986/28817 cut-off events. For 1154134/1154134 co-relation queries the response was YES. Maximal size of possible extension queue 2051. Compared 161012 event pairs, 0 based on Foata normal form. 0/24113 useless extension candidates. Maximal degree in co-relation 1052097. Up to 26330 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 151 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 837.9s, OverallIterations: 37, TraceHistogramMax: 2, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 800.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2806 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2806 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9308 IncrementalHoareTripleChecker+Invalid, 9402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 144 mSDtfsCounter, 9308 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1292 GetRequests, 1002 SyntacticMatches, 31 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462272occurred in iteration=36, InterpolantAutomatonStates: 211, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1481 NumberOfCodeBlocks, 1461 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1913 ConstructedInterpolants, 0 QuantifiedInterpolants, 4172 SizeOfPredicates, 53 NumberOfNonLiveVariables, 3720 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 75 InterpolantComputations, 18 PerfectInterpolantSequences, 49/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown