/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/chl-word-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 07:17:03,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 07:17:03,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 07:17:03,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 07:17:03,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 07:17:03,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 07:17:03,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 07:17:03,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 07:17:03,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 07:17:03,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 07:17:03,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 07:17:03,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 07:17:03,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 07:17:03,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 07:17:03,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 07:17:03,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 07:17:03,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 07:17:03,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 07:17:03,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 07:17:03,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 07:17:03,386 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 07:17:03,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 07:17:03,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 07:17:03,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 07:17:03,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 07:17:03,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 07:17:03,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 07:17:03,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 07:17:03,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 07:17:03,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 07:17:03,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 07:17:03,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 07:17:03,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 07:17:03,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 07:17:03,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 07:17:03,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 07:17:03,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 07:17:03,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 07:17:03,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 07:17:03,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 07:17:03,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 07:17:03,420 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:17:03,439 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 07:17:03,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 07:17:03,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 07:17:03,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 07:17:03,441 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 07:17:03,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 07:17:03,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 07:17:03,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 07:17:03,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 07:17:03,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 07:17:03,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 07:17:03,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 07:17:03,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 07:17:03,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 07:17:03,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 07:17:03,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 07:17:03,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 07:17:03,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 07:17:03,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 07:17:03,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 07:17:03,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 07:17:03,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:17:03,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 07:17:03,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 07:17:03,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 07:17:03,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 07:17:03,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 07:17:03,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 07:17:03,445 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:17:03,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 07:17:03,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 07:17:03,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 07:17:03,745 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 07:17:03,746 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 07:17:03,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-12-13 07:17:04,776 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 07:17:05,004 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 07:17:05,005 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-word-subst.wvr.c [2022-12-13 07:17:05,013 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea98196b/d6b431a6b1b14984867b2cc05e1c7d91/FLAGf2bf4fd09 [2022-12-13 07:17:05,025 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea98196b/d6b431a6b1b14984867b2cc05e1c7d91 [2022-12-13 07:17:05,027 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 07:17:05,031 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 07:17:05,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 07:17:05,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 07:17:05,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 07:17:05,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c617309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05, skipping insertion in model container [2022-12-13 07:17:05,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 07:17:05,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 07:17:05,213 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/chl-word-subst.wvr.c[3345,3358] [2022-12-13 07:17:05,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:17:05,229 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 07:17:05,257 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/chl-word-subst.wvr.c[3345,3358] [2022-12-13 07:17:05,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 07:17:05,274 INFO L208 MainTranslator]: Completed translation [2022-12-13 07:17:05,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05 WrapperNode [2022-12-13 07:17:05,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 07:17:05,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 07:17:05,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 07:17:05,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 07:17:05,283 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:17:05" (1/1) ... [2022-12-13 07:17:05,301 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:17:05" (1/1) ... [2022-12-13 07:17:05,329 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 176 [2022-12-13 07:17:05,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 07:17:05,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 07:17:05,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 07:17:05,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 07:17:05,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,351 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,361 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 07:17:05,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 07:17:05,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 07:17:05,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 07:17:05,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (1/1) ... [2022-12-13 07:17:05,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 07:17:05,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:17:05,401 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:17:05,432 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:17:05,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 07:17:05,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 07:17:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 07:17:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 07:17:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 07:17:05,459 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 07:17:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 07:17:05,459 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 07:17:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 07:17:05,459 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 07:17:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 07:17:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 07:17:05,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 07:17:05,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 07:17:05,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 07:17:05,461 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:17:05,597 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 07:17:05,598 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 07:17:05,848 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 07:17:05,855 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 07:17:05,856 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-13 07:17:05,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:17:05 BoogieIcfgContainer [2022-12-13 07:17:05,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 07:17:05,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 07:17:05,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 07:17:05,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 07:17:05,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 07:17:05" (1/3) ... [2022-12-13 07:17:05,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5fb988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:17:05, skipping insertion in model container [2022-12-13 07:17:05,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:17:05" (2/3) ... [2022-12-13 07:17:05,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5fb988 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 07:17:05, skipping insertion in model container [2022-12-13 07:17:05,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:17:05" (3/3) ... [2022-12-13 07:17:05,866 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2022-12-13 07:17:05,881 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 07:17:05,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 07:17:05,882 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 07:17:05,949 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 07:17:05,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 269 places, 288 transitions, 600 flow [2022-12-13 07:17:06,077 INFO L130 PetriNetUnfolder]: 29/285 cut-off events. [2022-12-13 07:17:06,077 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:17:06,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 285 events. 29/285 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 372 event pairs, 0 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-13 07:17:06,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 269 places, 288 transitions, 600 flow [2022-12-13 07:17:06,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 256 places, 275 transitions, 568 flow [2022-12-13 07:17:06,091 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:06,102 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 256 places, 275 transitions, 568 flow [2022-12-13 07:17:06,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 275 transitions, 568 flow [2022-12-13 07:17:06,179 INFO L130 PetriNetUnfolder]: 29/275 cut-off events. [2022-12-13 07:17:06,179 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:17:06,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 275 events. 29/275 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 371 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 223. Up to 3 conditions per place. [2022-12-13 07:17:06,187 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 256 places, 275 transitions, 568 flow [2022-12-13 07:17:06,187 INFO L226 LiptonReduction]: Number of co-enabled transitions 7560 [2022-12-13 07:17:14,206 INFO L241 LiptonReduction]: Total number of compositions: 235 [2022-12-13 07:17:14,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 07:17:14,236 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;@1cec6779, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 07:17:14,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 07:17:14,248 INFO L130 PetriNetUnfolder]: 11/38 cut-off events. [2022-12-13 07:17:14,248 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 07:17:14,248 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:14,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:17:14,249 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 1 more)] === [2022-12-13 07:17:14,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1687508420, now seen corresponding path program 1 times [2022-12-13 07:17:14,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:14,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590217293] [2022-12-13 07:17:14,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:14,630 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:17:14,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:14,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590217293] [2022-12-13 07:17:14,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590217293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:14,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:14,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 07:17:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932588777] [2022-12-13 07:17:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:14,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 07:17:14,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:14,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 07:17:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 07:17:14,656 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 07:17:14,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:17:14,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:14,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 07:17:14,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:14,828 INFO L130 PetriNetUnfolder]: 1087/1478 cut-off events. [2022-12-13 07:17:14,829 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2022-12-13 07:17:14,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3067 conditions, 1478 events. 1087/1478 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4933 event pairs, 481 based on Foata normal form. 1/940 useless extension candidates. Maximal degree in co-relation 2496. Up to 1127 conditions per place. [2022-12-13 07:17:14,835 INFO L137 encePairwiseOnDemand]: 36/39 looper letters, 34 selfloop transitions, 0 changer transitions 25/60 dead transitions. [2022-12-13 07:17:14,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 271 flow [2022-12-13 07:17:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 07:17:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 07:17:14,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 07:17:14,854 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-13 07:17:14,857 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2022-12-13 07:17:14,857 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 60 transitions, 271 flow [2022-12-13 07:17:14,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 35 transitions, 156 flow [2022-12-13 07:17:14,865 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:14,866 INFO L89 Accepts]: Start accepts. Operand has 37 places, 35 transitions, 156 flow [2022-12-13 07:17:14,869 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:14,870 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:14,870 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 35 transitions, 156 flow [2022-12-13 07:17:14,873 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 35 transitions, 156 flow [2022-12-13 07:17:14,873 INFO L226 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-13 07:17:14,879 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:14,881 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 07:17:14,882 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 156 flow [2022-12-13 07:17:14,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:17:14,882 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:14,882 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] [2022-12-13 07:17:14,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 07:17:14,885 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 1 more)] === [2022-12-13 07:17:14,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:14,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1714978131, now seen corresponding path program 1 times [2022-12-13 07:17:14,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:14,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387626002] [2022-12-13 07:17:14,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:15,502 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:17:15,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:15,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387626002] [2022-12-13 07:17:15,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387626002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:15,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:15,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:15,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545861086] [2022-12-13 07:17:15,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:15,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:17:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:17:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:17:15,504 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:15,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:15,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:15,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:15,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:15,789 INFO L130 PetriNetUnfolder]: 644/911 cut-off events. [2022-12-13 07:17:15,790 INFO L131 PetriNetUnfolder]: For 80/96 co-relation queries the response was YES. [2022-12-13 07:17:15,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2808 conditions, 911 events. 644/911 cut-off events. For 80/96 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3234 event pairs, 38 based on Foata normal form. 1/619 useless extension candidates. Maximal degree in co-relation 2605. Up to 904 conditions per place. [2022-12-13 07:17:15,795 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 63 selfloop transitions, 2 changer transitions 10/76 dead transitions. [2022-12-13 07:17:15,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 76 transitions, 497 flow [2022-12-13 07:17:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:17:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:17:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-13 07:17:15,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2022-12-13 07:17:15,799 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 07:17:15,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 76 transitions, 497 flow [2022-12-13 07:17:15,804 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 66 transitions, 428 flow [2022-12-13 07:17:15,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:15,809 INFO L89 Accepts]: Start accepts. Operand has 40 places, 66 transitions, 428 flow [2022-12-13 07:17:15,810 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:15,811 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:15,811 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 66 transitions, 428 flow [2022-12-13 07:17:15,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 66 transitions, 428 flow [2022-12-13 07:17:15,813 INFO L226 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-13 07:17:15,816 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:15,817 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:17:15,817 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 66 transitions, 428 flow [2022-12-13 07:17:15,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:15,817 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:15,817 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] [2022-12-13 07:17:15,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 07:17:15,817 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 1 more)] === [2022-12-13 07:17:15,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:15,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1253104725, now seen corresponding path program 2 times [2022-12-13 07:17:15,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:15,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560894158] [2022-12-13 07:17:15,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:15,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:16,304 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:17:16,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:16,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560894158] [2022-12-13 07:17:16,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560894158] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:16,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:16,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:16,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538519533] [2022-12-13 07:17:16,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:16,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:17:16,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:16,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:17:16,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:17:16,306 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:16,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 66 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:16,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:16,307 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:16,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:16,550 INFO L130 PetriNetUnfolder]: 706/1028 cut-off events. [2022-12-13 07:17:16,550 INFO L131 PetriNetUnfolder]: For 120/168 co-relation queries the response was YES. [2022-12-13 07:17:16,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4213 conditions, 1028 events. 706/1028 cut-off events. For 120/168 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3834 event pairs, 21 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 3872. Up to 1026 conditions per place. [2022-12-13 07:17:16,556 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 118 selfloop transitions, 14 changer transitions 12/145 dead transitions. [2022-12-13 07:17:16,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 145 transitions, 1232 flow [2022-12-13 07:17:16,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:17:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:17:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2022-12-13 07:17:16,557 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 07:17:16,558 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-13 07:17:16,558 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 145 transitions, 1232 flow [2022-12-13 07:17:16,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 133 transitions, 1127 flow [2022-12-13 07:17:16,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:16,567 INFO L89 Accepts]: Start accepts. Operand has 44 places, 133 transitions, 1127 flow [2022-12-13 07:17:16,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:16,569 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:16,569 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 133 transitions, 1127 flow [2022-12-13 07:17:16,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 133 transitions, 1127 flow [2022-12-13 07:17:16,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 56 [2022-12-13 07:17:16,573 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:16,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:17:16,574 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 133 transitions, 1127 flow [2022-12-13 07:17:16,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:16,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:16,574 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] [2022-12-13 07:17:16,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 07:17:16,575 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 1 more)] === [2022-12-13 07:17:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:16,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1388856647, now seen corresponding path program 3 times [2022-12-13 07:17:16,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:16,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120760923] [2022-12-13 07:17:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:16,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:17,020 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:17:17,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:17,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120760923] [2022-12-13 07:17:17,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120760923] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:17,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:17,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389930607] [2022-12-13 07:17:17,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:17,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:17:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:17:17,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:17:17,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:17,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 133 transitions, 1127 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:17,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:17,023 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:17,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:17,256 INFO L130 PetriNetUnfolder]: 774/1138 cut-off events. [2022-12-13 07:17:17,256 INFO L131 PetriNetUnfolder]: For 163/259 co-relation queries the response was YES. [2022-12-13 07:17:17,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5796 conditions, 1138 events. 774/1138 cut-off events. For 163/259 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4392 event pairs, 19 based on Foata normal form. 10/797 useless extension candidates. Maximal degree in co-relation 5355. Up to 1136 conditions per place. [2022-12-13 07:17:17,262 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 142 selfloop transitions, 6 changer transitions 10/159 dead transitions. [2022-12-13 07:17:17,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 159 transitions, 1669 flow [2022-12-13 07:17:17,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:17:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:17:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-13 07:17:17,263 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2022-12-13 07:17:17,264 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-13 07:17:17,264 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 159 transitions, 1669 flow [2022-12-13 07:17:17,269 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 149 transitions, 1560 flow [2022-12-13 07:17:17,274 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:17,274 INFO L89 Accepts]: Start accepts. Operand has 47 places, 149 transitions, 1560 flow [2022-12-13 07:17:17,275 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:17,275 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:17,275 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 149 transitions, 1560 flow [2022-12-13 07:17:17,277 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 149 transitions, 1560 flow [2022-12-13 07:17:17,277 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 07:17:17,279 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:17,280 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 07:17:17,280 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 149 transitions, 1560 flow [2022-12-13 07:17:17,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:17,280 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:17,280 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] [2022-12-13 07:17:17,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 07:17:17,280 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 1 more)] === [2022-12-13 07:17:17,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:17,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1244879295, now seen corresponding path program 4 times [2022-12-13 07:17:17,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:17,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300731596] [2022-12-13 07:17:17,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:17,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:17,677 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:17:17,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:17,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300731596] [2022-12-13 07:17:17,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300731596] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:17,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:17,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:17,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123941983] [2022-12-13 07:17:17,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:17,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:17:17,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:17,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:17:17,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:17:17,681 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:17,681 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 149 transitions, 1560 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:17,681 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:17,681 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:17,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:17,989 INFO L130 PetriNetUnfolder]: 763/1115 cut-off events. [2022-12-13 07:17:17,989 INFO L131 PetriNetUnfolder]: For 190/294 co-relation queries the response was YES. [2022-12-13 07:17:17,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6791 conditions, 1115 events. 763/1115 cut-off events. For 190/294 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4268 event pairs, 19 based on Foata normal form. 2/776 useless extension candidates. Maximal degree in co-relation 6294. Up to 1113 conditions per place. [2022-12-13 07:17:17,996 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 132 selfloop transitions, 5 changer transitions 10/148 dead transitions. [2022-12-13 07:17:17,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 148 transitions, 1844 flow [2022-12-13 07:17:17,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:17:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:17:17,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-13 07:17:17,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2022-12-13 07:17:18,000 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2022-12-13 07:17:18,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 148 transitions, 1844 flow [2022-12-13 07:17:18,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 138 transitions, 1715 flow [2022-12-13 07:17:18,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:18,015 INFO L89 Accepts]: Start accepts. Operand has 49 places, 138 transitions, 1715 flow [2022-12-13 07:17:18,016 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:18,016 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:18,016 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 138 transitions, 1715 flow [2022-12-13 07:17:18,018 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 138 transitions, 1715 flow [2022-12-13 07:17:18,019 INFO L226 LiptonReduction]: Number of co-enabled transitions 68 [2022-12-13 07:17:18,021 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:18,022 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:17:18,022 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 138 transitions, 1715 flow [2022-12-13 07:17:18,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:18,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:18,023 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] [2022-12-13 07:17:18,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 07:17:18,023 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 1 more)] === [2022-12-13 07:17:18,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1060492089, now seen corresponding path program 5 times [2022-12-13 07:17:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:18,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512415026] [2022-12-13 07:17:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:18,399 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:17:18,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:18,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512415026] [2022-12-13 07:17:18,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512415026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:18,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:18,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:18,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537713880] [2022-12-13 07:17:18,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:18,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:17:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:18,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:17:18,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:17:18,401 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:18,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 138 transitions, 1715 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:18,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:18,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:18,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:18,698 INFO L130 PetriNetUnfolder]: 847/1270 cut-off events. [2022-12-13 07:17:18,698 INFO L131 PetriNetUnfolder]: For 424/644 co-relation queries the response was YES. [2022-12-13 07:17:18,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8981 conditions, 1270 events. 847/1270 cut-off events. For 424/644 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5181 event pairs, 23 based on Foata normal form. 13/912 useless extension candidates. Maximal degree in co-relation 8360. Up to 1265 conditions per place. [2022-12-13 07:17:18,709 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 167 selfloop transitions, 5 changer transitions 12/185 dead transitions. [2022-12-13 07:17:18,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 185 transitions, 2674 flow [2022-12-13 07:17:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:17:18,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:17:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-12-13 07:17:18,711 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44571428571428573 [2022-12-13 07:17:18,713 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2022-12-13 07:17:18,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 185 transitions, 2674 flow [2022-12-13 07:17:18,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 173 transitions, 2497 flow [2022-12-13 07:17:18,727 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:18,727 INFO L89 Accepts]: Start accepts. Operand has 52 places, 173 transitions, 2497 flow [2022-12-13 07:17:18,729 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:18,729 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:18,729 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 173 transitions, 2497 flow [2022-12-13 07:17:18,732 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 173 transitions, 2497 flow [2022-12-13 07:17:18,732 INFO L226 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-13 07:17:18,734 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:18,735 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 07:17:18,735 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 173 transitions, 2497 flow [2022-12-13 07:17:18,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:18,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:18,735 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] [2022-12-13 07:17:18,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 07:17:18,735 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 1 more)] === [2022-12-13 07:17:18,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:18,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1186258659, now seen corresponding path program 6 times [2022-12-13 07:17:18,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:18,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117775384] [2022-12-13 07:17:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:18,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:19,053 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:17:19,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:19,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117775384] [2022-12-13 07:17:19,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117775384] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:19,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:19,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631442377] [2022-12-13 07:17:19,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:19,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:17:19,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:17:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:17:19,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:19,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 173 transitions, 2497 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:19,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:19,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:19,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:19,344 INFO L130 PetriNetUnfolder]: 841/1250 cut-off events. [2022-12-13 07:17:19,345 INFO L131 PetriNetUnfolder]: For 591/891 co-relation queries the response was YES. [2022-12-13 07:17:19,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10083 conditions, 1250 events. 841/1250 cut-off events. For 591/891 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5009 event pairs, 23 based on Foata normal form. 29/912 useless extension candidates. Maximal degree in co-relation 9412. Up to 1245 conditions per place. [2022-12-13 07:17:19,352 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 147 selfloop transitions, 14 changer transitions 10/172 dead transitions. [2022-12-13 07:17:19,352 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 172 transitions, 2825 flow [2022-12-13 07:17:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:17:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:17:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-13 07:17:19,353 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2022-12-13 07:17:19,353 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2022-12-13 07:17:19,353 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 172 transitions, 2825 flow [2022-12-13 07:17:19,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 162 transitions, 2656 flow [2022-12-13 07:17:19,366 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:19,367 INFO L89 Accepts]: Start accepts. Operand has 55 places, 162 transitions, 2656 flow [2022-12-13 07:17:19,368 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:19,368 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:19,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 162 transitions, 2656 flow [2022-12-13 07:17:19,370 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 162 transitions, 2656 flow [2022-12-13 07:17:19,370 INFO L226 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-13 07:17:19,373 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:19,373 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 07:17:19,373 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 162 transitions, 2656 flow [2022-12-13 07:17:19,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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:17:19,373 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:19,374 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] [2022-12-13 07:17:19,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 07:17:19,374 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 1 more)] === [2022-12-13 07:17:19,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:19,374 INFO L85 PathProgramCache]: Analyzing trace with hash -421217724, now seen corresponding path program 1 times [2022-12-13 07:17:19,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:19,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855852199] [2022-12-13 07:17:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:19,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:19,434 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:17:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:19,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855852199] [2022-12-13 07:17:19,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855852199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:19,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:19,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:19,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418692453] [2022-12-13 07:17:19,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:19,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:19,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:19,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:19,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:19,436 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:19,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 162 transitions, 2656 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:19,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:19,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:19,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:19,642 INFO L130 PetriNetUnfolder]: 1022/1534 cut-off events. [2022-12-13 07:17:19,642 INFO L131 PetriNetUnfolder]: For 1183/1397 co-relation queries the response was YES. [2022-12-13 07:17:19,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13756 conditions, 1534 events. 1022/1534 cut-off events. For 1183/1397 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6476 event pairs, 0 based on Foata normal form. 8/1117 useless extension candidates. Maximal degree in co-relation 12959. Up to 1509 conditions per place. [2022-12-13 07:17:19,651 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 245 selfloop transitions, 17 changer transitions 0/263 dead transitions. [2022-12-13 07:17:19,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 263 transitions, 4847 flow [2022-12-13 07:17:19,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:17:19,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:17:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-13 07:17:19,653 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2022-12-13 07:17:19,655 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2022-12-13 07:17:19,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 263 transitions, 4847 flow [2022-12-13 07:17:19,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 263 transitions, 4847 flow [2022-12-13 07:17:19,673 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:19,673 INFO L89 Accepts]: Start accepts. Operand has 58 places, 263 transitions, 4847 flow [2022-12-13 07:17:19,675 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:19,675 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:19,675 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 263 transitions, 4847 flow [2022-12-13 07:17:19,679 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 263 transitions, 4847 flow [2022-12-13 07:17:19,679 INFO L226 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-13 07:17:19,685 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:19,686 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 07:17:19,686 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 263 transitions, 4847 flow [2022-12-13 07:17:19,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:19,687 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:19,687 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] [2022-12-13 07:17:19,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 07:17:19,687 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 1 more)] === [2022-12-13 07:17:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:19,688 INFO L85 PathProgramCache]: Analyzing trace with hash 572077640, now seen corresponding path program 2 times [2022-12-13 07:17:19,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:19,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362585917] [2022-12-13 07:17:19,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:19,748 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:17:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:19,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362585917] [2022-12-13 07:17:19,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362585917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:19,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:19,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:19,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839342138] [2022-12-13 07:17:19,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:19,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:19,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:19,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:19,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:19,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:19,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 263 transitions, 4847 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:19,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:19,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:19,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:19,994 INFO L130 PetriNetUnfolder]: 988/1508 cut-off events. [2022-12-13 07:17:19,994 INFO L131 PetriNetUnfolder]: For 1787/2065 co-relation queries the response was YES. [2022-12-13 07:17:19,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14933 conditions, 1508 events. 988/1508 cut-off events. For 1787/2065 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6474 event pairs, 0 based on Foata normal form. 34/1151 useless extension candidates. Maximal degree in co-relation 14071. Up to 1475 conditions per place. [2022-12-13 07:17:20,004 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 261 selfloop transitions, 18 changer transitions 0/280 dead transitions. [2022-12-13 07:17:20,004 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 280 transitions, 5720 flow [2022-12-13 07:17:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:17:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:17:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2022-12-13 07:17:20,005 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-13 07:17:20,006 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2022-12-13 07:17:20,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 280 transitions, 5720 flow [2022-12-13 07:17:20,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 280 transitions, 5720 flow [2022-12-13 07:17:20,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:20,025 INFO L89 Accepts]: Start accepts. Operand has 61 places, 280 transitions, 5720 flow [2022-12-13 07:17:20,030 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:20,030 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:20,030 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 280 transitions, 5720 flow [2022-12-13 07:17:20,035 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 280 transitions, 5720 flow [2022-12-13 07:17:20,035 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:17:20,041 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:20,042 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 07:17:20,042 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 280 transitions, 5720 flow [2022-12-13 07:17:20,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:20,043 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:20,043 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] [2022-12-13 07:17:20,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 07:17:20,044 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 1 more)] === [2022-12-13 07:17:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1178585992, now seen corresponding path program 1 times [2022-12-13 07:17:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:20,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112014608] [2022-12-13 07:17:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:20,112 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:17:20,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:20,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112014608] [2022-12-13 07:17:20,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112014608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:20,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:20,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918508019] [2022-12-13 07:17:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:20,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:20,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:20,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:20,114 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:20,114 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 280 transitions, 5720 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:20,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:20,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:20,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:20,414 INFO L130 PetriNetUnfolder]: 978/1498 cut-off events. [2022-12-13 07:17:20,414 INFO L131 PetriNetUnfolder]: For 2101/2323 co-relation queries the response was YES. [2022-12-13 07:17:20,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16298 conditions, 1498 events. 978/1498 cut-off events. For 2101/2323 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6496 event pairs, 2 based on Foata normal form. 26/1133 useless extension candidates. Maximal degree in co-relation 15375. Up to 1465 conditions per place. [2022-12-13 07:17:20,424 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 257 selfloop transitions, 16 changer transitions 11/285 dead transitions. [2022-12-13 07:17:20,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 285 transitions, 6388 flow [2022-12-13 07:17:20,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:17:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:17:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 07:17:20,425 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2022-12-13 07:17:20,426 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2022-12-13 07:17:20,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 285 transitions, 6388 flow [2022-12-13 07:17:20,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 274 transitions, 6137 flow [2022-12-13 07:17:20,447 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:20,447 INFO L89 Accepts]: Start accepts. Operand has 65 places, 274 transitions, 6137 flow [2022-12-13 07:17:20,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:20,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:20,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 274 transitions, 6137 flow [2022-12-13 07:17:20,455 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 274 transitions, 6137 flow [2022-12-13 07:17:20,455 INFO L226 LiptonReduction]: Number of co-enabled transitions 128 [2022-12-13 07:17:20,460 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:20,460 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 07:17:20,460 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 274 transitions, 6137 flow [2022-12-13 07:17:20,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:20,461 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:20,461 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] [2022-12-13 07:17:20,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 07:17:20,461 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 1 more)] === [2022-12-13 07:17:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash -254114890, now seen corresponding path program 3 times [2022-12-13 07:17:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:20,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008005509] [2022-12-13 07:17:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:20,525 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:17:20,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:20,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008005509] [2022-12-13 07:17:20,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008005509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:20,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:20,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:20,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275976779] [2022-12-13 07:17:20,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:20,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:20,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:20,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:20,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:20,527 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:20,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 274 transitions, 6137 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:20,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:20,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:20,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:20,755 INFO L130 PetriNetUnfolder]: 895/1355 cut-off events. [2022-12-13 07:17:20,756 INFO L131 PetriNetUnfolder]: For 2088/2382 co-relation queries the response was YES. [2022-12-13 07:17:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16121 conditions, 1355 events. 895/1355 cut-off events. For 2088/2382 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5611 event pairs, 2 based on Foata normal form. 28/1034 useless extension candidates. Maximal degree in co-relation 15192. Up to 1330 conditions per place. [2022-12-13 07:17:20,765 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 235 selfloop transitions, 15 changer transitions 7/258 dead transitions. [2022-12-13 07:17:20,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 258 transitions, 6290 flow [2022-12-13 07:17:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:17:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:17:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-13 07:17:20,767 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2022-12-13 07:17:20,767 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 31 predicate places. [2022-12-13 07:17:20,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 258 transitions, 6290 flow [2022-12-13 07:17:20,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 251 transitions, 6119 flow [2022-12-13 07:17:20,788 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:20,788 INFO L89 Accepts]: Start accepts. Operand has 68 places, 251 transitions, 6119 flow [2022-12-13 07:17:20,790 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:20,790 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:20,790 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 251 transitions, 6119 flow [2022-12-13 07:17:20,795 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 251 transitions, 6119 flow [2022-12-13 07:17:20,795 INFO L226 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-13 07:17:20,800 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:20,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:17:20,800 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 251 transitions, 6119 flow [2022-12-13 07:17:20,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:20,800 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:20,800 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] [2022-12-13 07:17:20,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 07:17:20,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 1 more)] === [2022-12-13 07:17:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1656803726, now seen corresponding path program 2 times [2022-12-13 07:17:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:20,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316105951] [2022-12-13 07:17:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:20,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:20,876 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:17:20,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:20,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316105951] [2022-12-13 07:17:20,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316105951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:20,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:20,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:20,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492779000] [2022-12-13 07:17:20,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:20,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:20,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:20,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:20,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:20,879 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:20,879 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 251 transitions, 6119 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:20,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:20,880 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:20,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:21,151 INFO L130 PetriNetUnfolder]: 948/1438 cut-off events. [2022-12-13 07:17:21,151 INFO L131 PetriNetUnfolder]: For 2488/2782 co-relation queries the response was YES. [2022-12-13 07:17:21,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18536 conditions, 1438 events. 948/1438 cut-off events. For 2488/2782 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6031 event pairs, 0 based on Foata normal form. 4/1077 useless extension candidates. Maximal degree in co-relation 17399. Up to 1413 conditions per place. [2022-12-13 07:17:21,163 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 262 selfloop transitions, 16 changer transitions 0/279 dead transitions. [2022-12-13 07:17:21,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 279 transitions, 7362 flow [2022-12-13 07:17:21,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:17:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:17:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 07:17:21,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2022-12-13 07:17:21,165 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2022-12-13 07:17:21,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 279 transitions, 7362 flow [2022-12-13 07:17:21,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 279 transitions, 7362 flow [2022-12-13 07:17:21,189 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:21,189 INFO L89 Accepts]: Start accepts. Operand has 71 places, 279 transitions, 7362 flow [2022-12-13 07:17:21,191 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:21,191 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:21,191 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 279 transitions, 7362 flow [2022-12-13 07:17:21,197 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 279 transitions, 7362 flow [2022-12-13 07:17:21,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-13 07:17:21,202 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:21,202 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 07:17:21,203 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 279 transitions, 7362 flow [2022-12-13 07:17:21,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:21,203 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:21,203 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] [2022-12-13 07:17:21,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 07:17:21,203 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 1 more)] === [2022-12-13 07:17:21,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1502119418, now seen corresponding path program 4 times [2022-12-13 07:17:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:21,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872175794] [2022-12-13 07:17:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:21,274 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:17:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:21,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872175794] [2022-12-13 07:17:21,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872175794] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:21,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:21,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901996310] [2022-12-13 07:17:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:21,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:21,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:21,277 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:21,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 279 transitions, 7362 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:21,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:21,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:21,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:21,546 INFO L130 PetriNetUnfolder]: 956/1460 cut-off events. [2022-12-13 07:17:21,547 INFO L131 PetriNetUnfolder]: For 3134/3580 co-relation queries the response was YES. [2022-12-13 07:17:21,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20231 conditions, 1460 events. 956/1460 cut-off events. For 3134/3580 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6248 event pairs, 0 based on Foata normal form. 28/1117 useless extension candidates. Maximal degree in co-relation 19009. Up to 1433 conditions per place. [2022-12-13 07:17:21,557 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 264 selfloop transitions, 10 changer transitions 13/288 dead transitions. [2022-12-13 07:17:21,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 288 transitions, 8170 flow [2022-12-13 07:17:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:17:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:17:21,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-13 07:17:21,558 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2022-12-13 07:17:21,559 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-13 07:17:21,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 288 transitions, 8170 flow [2022-12-13 07:17:21,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 275 transitions, 7806 flow [2022-12-13 07:17:21,578 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:21,579 INFO L89 Accepts]: Start accepts. Operand has 74 places, 275 transitions, 7806 flow [2022-12-13 07:17:21,582 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:21,582 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:21,583 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 275 transitions, 7806 flow [2022-12-13 07:17:21,589 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 275 transitions, 7806 flow [2022-12-13 07:17:21,589 INFO L226 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-13 07:17:21,594 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:21,594 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 07:17:21,594 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 275 transitions, 7806 flow [2022-12-13 07:17:21,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:21,595 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:21,595 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] [2022-12-13 07:17:21,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 07:17:21,595 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 1 more)] === [2022-12-13 07:17:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:21,595 INFO L85 PathProgramCache]: Analyzing trace with hash 62495068, now seen corresponding path program 3 times [2022-12-13 07:17:21,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:21,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472058560] [2022-12-13 07:17:21,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:21,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:21,653 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:17:21,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:21,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472058560] [2022-12-13 07:17:21,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472058560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:21,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:21,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:21,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197854739] [2022-12-13 07:17:21,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:21,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:21,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:21,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:21,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:21,655 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:21,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 275 transitions, 7806 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:21,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:21,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:21,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:21,955 INFO L130 PetriNetUnfolder]: 840/1266 cut-off events. [2022-12-13 07:17:21,956 INFO L131 PetriNetUnfolder]: For 2735/3069 co-relation queries the response was YES. [2022-12-13 07:17:21,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18855 conditions, 1266 events. 840/1266 cut-off events. For 2735/3069 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5107 event pairs, 0 based on Foata normal form. 22/973 useless extension candidates. Maximal degree in co-relation 17793. Up to 1247 conditions per place. [2022-12-13 07:17:21,964 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 221 selfloop transitions, 6 changer transitions 18/246 dead transitions. [2022-12-13 07:17:21,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 246 transitions, 7466 flow [2022-12-13 07:17:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:17:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:17:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-13 07:17:21,965 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48 [2022-12-13 07:17:21,966 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 40 predicate places. [2022-12-13 07:17:21,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 246 transitions, 7466 flow [2022-12-13 07:17:21,974 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 228 transitions, 6914 flow [2022-12-13 07:17:21,983 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:21,983 INFO L89 Accepts]: Start accepts. Operand has 78 places, 228 transitions, 6914 flow [2022-12-13 07:17:21,985 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:21,985 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:21,986 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 228 transitions, 6914 flow [2022-12-13 07:17:21,991 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 228 transitions, 6914 flow [2022-12-13 07:17:21,991 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 07:17:21,994 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:21,995 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:17:21,995 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 228 transitions, 6914 flow [2022-12-13 07:17:21,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:21,995 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:21,995 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] [2022-12-13 07:17:21,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 07:17:21,995 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 1 more)] === [2022-12-13 07:17:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1631450724, now seen corresponding path program 4 times [2022-12-13 07:17:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:21,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641390661] [2022-12-13 07:17:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:22,057 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:17:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:22,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641390661] [2022-12-13 07:17:22,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641390661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:22,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:22,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101833684] [2022-12-13 07:17:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:22,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:22,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:22,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:22,059 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:22,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 228 transitions, 6914 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:22,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:22,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:22,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:22,265 INFO L130 PetriNetUnfolder]: 792/1172 cut-off events. [2022-12-13 07:17:22,265 INFO L131 PetriNetUnfolder]: For 3208/3610 co-relation queries the response was YES. [2022-12-13 07:17:22,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18584 conditions, 1172 events. 792/1172 cut-off events. For 3208/3610 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4471 event pairs, 0 based on Foata normal form. 8/885 useless extension candidates. Maximal degree in co-relation 17649. Up to 1153 conditions per place. [2022-12-13 07:17:22,273 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 204 selfloop transitions, 2 changer transitions 8/215 dead transitions. [2022-12-13 07:17:22,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 215 transitions, 6943 flow [2022-12-13 07:17:22,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:17:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:17:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-13 07:17:22,274 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40714285714285714 [2022-12-13 07:17:22,275 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-13 07:17:22,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 215 transitions, 6943 flow [2022-12-13 07:17:22,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 207 transitions, 6684 flow [2022-12-13 07:17:22,291 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:22,292 INFO L89 Accepts]: Start accepts. Operand has 78 places, 207 transitions, 6684 flow [2022-12-13 07:17:22,295 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:22,295 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:22,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 207 transitions, 6684 flow [2022-12-13 07:17:22,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 207 transitions, 6684 flow [2022-12-13 07:17:22,299 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 07:17:22,302 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:22,303 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 07:17:22,303 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 207 transitions, 6684 flow [2022-12-13 07:17:22,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:22,304 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:22,304 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] [2022-12-13 07:17:22,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 07:17:22,304 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 1 more)] === [2022-12-13 07:17:22,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:22,304 INFO L85 PathProgramCache]: Analyzing trace with hash -2007308404, now seen corresponding path program 5 times [2022-12-13 07:17:22,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:22,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400238460] [2022-12-13 07:17:22,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:22,360 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:17:22,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:22,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400238460] [2022-12-13 07:17:22,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400238460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:22,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:22,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576780053] [2022-12-13 07:17:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:22,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:22,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:22,363 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 35 [2022-12-13 07:17:22,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 207 transitions, 6684 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:22,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:22,364 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 35 [2022-12-13 07:17:22,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:22,538 INFO L130 PetriNetUnfolder]: 743/1093 cut-off events. [2022-12-13 07:17:22,538 INFO L131 PetriNetUnfolder]: For 3736/4206 co-relation queries the response was YES. [2022-12-13 07:17:22,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18387 conditions, 1093 events. 743/1093 cut-off events. For 3736/4206 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4087 event pairs, 0 based on Foata normal form. 4/838 useless extension candidates. Maximal degree in co-relation 17568. Up to 1074 conditions per place. [2022-12-13 07:17:22,546 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 195 selfloop transitions, 11 changer transitions 0/207 dead transitions. [2022-12-13 07:17:22,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 207 transitions, 7093 flow [2022-12-13 07:17:22,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:17:22,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:17:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-13 07:17:22,547 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2022-12-13 07:17:22,548 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 36 predicate places. [2022-12-13 07:17:22,548 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 207 transitions, 7093 flow [2022-12-13 07:17:22,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 207 transitions, 7093 flow [2022-12-13 07:17:22,564 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:22,565 INFO L89 Accepts]: Start accepts. Operand has 74 places, 207 transitions, 7093 flow [2022-12-13 07:17:22,567 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:22,567 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:22,567 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 207 transitions, 7093 flow [2022-12-13 07:17:22,571 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 207 transitions, 7093 flow [2022-12-13 07:17:22,571 INFO L226 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-13 07:17:22,573 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:22,574 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:17:22,574 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 207 transitions, 7093 flow [2022-12-13 07:17:22,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:22,574 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:22,574 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] [2022-12-13 07:17:22,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 07:17:22,574 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 1 more)] === [2022-12-13 07:17:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:22,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2041875942, now seen corresponding path program 5 times [2022-12-13 07:17:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:22,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303328051] [2022-12-13 07:17:22,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:22,625 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:17:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303328051] [2022-12-13 07:17:22,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303328051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:22,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:22,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:17:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042239073] [2022-12-13 07:17:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:22,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:22,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:22,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:22,627 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 34 [2022-12-13 07:17:22,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 207 transitions, 7093 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:22,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:22,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 34 [2022-12-13 07:17:22,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:22,813 INFO L130 PetriNetUnfolder]: 683/997 cut-off events. [2022-12-13 07:17:22,813 INFO L131 PetriNetUnfolder]: For 4322/4860 co-relation queries the response was YES. [2022-12-13 07:17:22,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17727 conditions, 997 events. 683/997 cut-off events. For 4322/4860 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3643 event pairs, 0 based on Foata normal form. 12/774 useless extension candidates. Maximal degree in co-relation 16935. Up to 978 conditions per place. [2022-12-13 07:17:22,821 INFO L137 encePairwiseOnDemand]: 31/34 looper letters, 181 selfloop transitions, 0 changer transitions 9/191 dead transitions. [2022-12-13 07:17:22,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 191 transitions, 6920 flow [2022-12-13 07:17:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:17:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:17:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-13 07:17:22,822 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3382352941176471 [2022-12-13 07:17:22,823 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-13 07:17:22,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 191 transitions, 6920 flow [2022-12-13 07:17:22,831 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 182 transitions, 6596 flow [2022-12-13 07:17:22,837 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:22,838 INFO L89 Accepts]: Start accepts. Operand has 68 places, 182 transitions, 6596 flow [2022-12-13 07:17:22,840 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:22,840 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:22,840 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 182 transitions, 6596 flow [2022-12-13 07:17:22,843 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 182 transitions, 6596 flow [2022-12-13 07:17:22,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-13 07:17:22,847 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:22,847 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 07:17:22,847 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 182 transitions, 6596 flow [2022-12-13 07:17:22,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:17:22,847 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:22,847 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] [2022-12-13 07:17:22,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 07:17:22,848 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 1 more)] === [2022-12-13 07:17:22,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:22,848 INFO L85 PathProgramCache]: Analyzing trace with hash 553585205, now seen corresponding path program 1 times [2022-12-13 07:17:22,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:22,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438183270] [2022-12-13 07:17:22,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:22,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:23,288 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:17:23,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:23,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438183270] [2022-12-13 07:17:23,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438183270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:23,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:23,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:17:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691157001] [2022-12-13 07:17:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:23,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:17:23,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:17:23,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:17:23,290 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-13 07:17:23,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 182 transitions, 6596 flow. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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:17:23,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:23,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-13 07:17:23,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:23,736 INFO L130 PetriNetUnfolder]: 1287/1890 cut-off events. [2022-12-13 07:17:23,736 INFO L131 PetriNetUnfolder]: For 8290/9048 co-relation queries the response was YES. [2022-12-13 07:17:23,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35484 conditions, 1890 events. 1287/1890 cut-off events. For 8290/9048 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8063 event pairs, 0 based on Foata normal form. 15/1507 useless extension candidates. Maximal degree in co-relation 17507. Up to 1855 conditions per place. [2022-12-13 07:17:23,751 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 280 selfloop transitions, 34 changer transitions 39/354 dead transitions. [2022-12-13 07:17:23,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 354 transitions, 13572 flow [2022-12-13 07:17:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:17:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:17:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2022-12-13 07:17:23,752 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2022-12-13 07:17:23,752 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-13 07:17:23,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 354 transitions, 13572 flow [2022-12-13 07:17:23,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 315 transitions, 12063 flow [2022-12-13 07:17:23,782 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:23,783 INFO L89 Accepts]: Start accepts. Operand has 75 places, 315 transitions, 12063 flow [2022-12-13 07:17:23,786 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:23,786 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:23,787 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 315 transitions, 12063 flow [2022-12-13 07:17:23,793 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 315 transitions, 12063 flow [2022-12-13 07:17:23,794 INFO L226 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-13 07:17:35,557 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 07:17:35,559 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11777 [2022-12-13 07:17:35,559 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 312 transitions, 11949 flow [2022-12-13 07:17:35,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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:17:35,560 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:35,560 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] [2022-12-13 07:17:35,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 07:17:35,560 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 1 more)] === [2022-12-13 07:17:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:35,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1647858795, now seen corresponding path program 1 times [2022-12-13 07:17:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:35,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315148651] [2022-12-13 07:17:35,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:35,688 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:17:35,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:35,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315148651] [2022-12-13 07:17:35,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315148651] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:35,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:35,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:17:35,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632006655] [2022-12-13 07:17:35,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:35,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:17:35,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:35,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:17:35,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:17:35,690 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 07:17:35,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 312 transitions, 11949 flow. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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:17:35,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:35,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 07:17:35,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:36,663 INFO L130 PetriNetUnfolder]: 3187/4626 cut-off events. [2022-12-13 07:17:36,664 INFO L131 PetriNetUnfolder]: For 18340/18944 co-relation queries the response was YES. [2022-12-13 07:17:36,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91310 conditions, 4626 events. 3187/4626 cut-off events. For 18340/18944 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22129 event pairs, 0 based on Foata normal form. 6/3615 useless extension candidates. Maximal degree in co-relation 18890. Up to 4537 conditions per place. [2022-12-13 07:17:36,692 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 487 selfloop transitions, 3 changer transitions 473/964 dead transitions. [2022-12-13 07:17:36,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 964 transitions, 38921 flow [2022-12-13 07:17:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 07:17:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 07:17:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2022-12-13 07:17:36,694 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2022-12-13 07:17:36,694 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 43 predicate places. [2022-12-13 07:17:36,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 964 transitions, 38921 flow [2022-12-13 07:17:36,724 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 491 transitions, 19809 flow [2022-12-13 07:17:36,769 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:36,770 INFO L89 Accepts]: Start accepts. Operand has 75 places, 491 transitions, 19809 flow [2022-12-13 07:17:36,777 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:36,777 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:36,777 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 491 transitions, 19809 flow [2022-12-13 07:17:36,796 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 491 transitions, 19809 flow [2022-12-13 07:17:36,796 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 07:17:37,053 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:17:37,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 285 [2022-12-13 07:17:37,054 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 490 transitions, 19769 flow [2022-12-13 07:17:37,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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:17:37,054 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:37,054 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] [2022-12-13 07:17:37,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 07:17:37,055 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 1 more)] === [2022-12-13 07:17:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash 550725996, now seen corresponding path program 1 times [2022-12-13 07:17:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:37,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188610244] [2022-12-13 07:17:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:37,372 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:17:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:37,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188610244] [2022-12-13 07:17:37,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188610244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:37,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:37,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:17:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465036362] [2022-12-13 07:17:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:37,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:17:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:17:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:17:37,374 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 07:17:37,374 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 490 transitions, 19769 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:37,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:37,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 07:17:37,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:38,226 INFO L130 PetriNetUnfolder]: 2515/3666 cut-off events. [2022-12-13 07:17:38,226 INFO L131 PetriNetUnfolder]: For 16946/17634 co-relation queries the response was YES. [2022-12-13 07:17:38,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75964 conditions, 3666 events. 2515/3666 cut-off events. For 16946/17634 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17188 event pairs, 0 based on Foata normal form. 5/2888 useless extension candidates. Maximal degree in co-relation 22361. Up to 3595 conditions per place. [2022-12-13 07:17:38,259 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 625 selfloop transitions, 22 changer transitions 53/701 dead transitions. [2022-12-13 07:17:38,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 701 transitions, 29720 flow [2022-12-13 07:17:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:17:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:17:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-12-13 07:17:38,260 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45634920634920634 [2022-12-13 07:17:38,260 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-13 07:17:38,260 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 701 transitions, 29720 flow [2022-12-13 07:17:38,295 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 648 transitions, 27458 flow [2022-12-13 07:17:38,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:38,334 INFO L89 Accepts]: Start accepts. Operand has 78 places, 648 transitions, 27458 flow [2022-12-13 07:17:38,342 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:38,342 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:38,342 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 648 transitions, 27458 flow [2022-12-13 07:17:38,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 648 transitions, 27458 flow [2022-12-13 07:17:38,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 07:17:38,380 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:38,380 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 07:17:38,380 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 648 transitions, 27458 flow [2022-12-13 07:17:38,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:38,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:38,381 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] [2022-12-13 07:17:38,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 07:17:38,381 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 1 more)] === [2022-12-13 07:17:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1769497444, now seen corresponding path program 2 times [2022-12-13 07:17:38,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:38,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913751821] [2022-12-13 07:17:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:38,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:38,652 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:17:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:38,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913751821] [2022-12-13 07:17:38,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913751821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:38,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:38,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:17:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047105371] [2022-12-13 07:17:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:38,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:17:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:17:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:17:38,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 07:17:38,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 648 transitions, 27458 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:38,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:38,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 07:17:38,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:39,735 INFO L130 PetriNetUnfolder]: 2693/3968 cut-off events. [2022-12-13 07:17:39,735 INFO L131 PetriNetUnfolder]: For 20967/21739 co-relation queries the response was YES. [2022-12-13 07:17:39,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85995 conditions, 3968 events. 2693/3968 cut-off events. For 20967/21739 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19348 event pairs, 0 based on Foata normal form. 5/3142 useless extension candidates. Maximal degree in co-relation 26480. Up to 3887 conditions per place. [2022-12-13 07:17:39,773 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 723 selfloop transitions, 27 changer transitions 13/764 dead transitions. [2022-12-13 07:17:39,773 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 764 transitions, 33907 flow [2022-12-13 07:17:39,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:17:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:17:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2022-12-13 07:17:39,774 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2022-12-13 07:17:39,775 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2022-12-13 07:17:39,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 764 transitions, 33907 flow [2022-12-13 07:17:39,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 751 transitions, 33326 flow [2022-12-13 07:17:39,858 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:39,858 INFO L89 Accepts]: Start accepts. Operand has 83 places, 751 transitions, 33326 flow [2022-12-13 07:17:39,867 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:39,867 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:39,867 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 751 transitions, 33326 flow [2022-12-13 07:17:39,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 751 transitions, 33326 flow [2022-12-13 07:17:39,889 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 07:17:39,909 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:39,911 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 07:17:39,911 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 751 transitions, 33326 flow [2022-12-13 07:17:39,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:39,911 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:39,911 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] [2022-12-13 07:17:39,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 07:17:39,911 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 1 more)] === [2022-12-13 07:17:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1896926044, now seen corresponding path program 3 times [2022-12-13 07:17:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:39,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818380361] [2022-12-13 07:17:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:40,439 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:17:40,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:40,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818380361] [2022-12-13 07:17:40,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818380361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:40,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:40,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:17:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667084874] [2022-12-13 07:17:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:40,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:17:40,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:40,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:17:40,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:17:40,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 07:17:40,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 751 transitions, 33326 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:40,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:40,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 07:17:40,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:41,459 INFO L130 PetriNetUnfolder]: 2679/3940 cut-off events. [2022-12-13 07:17:41,460 INFO L131 PetriNetUnfolder]: For 23174/24030 co-relation queries the response was YES. [2022-12-13 07:17:41,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89235 conditions, 3940 events. 2679/3940 cut-off events. For 23174/24030 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19160 event pairs, 0 based on Foata normal form. 5/3126 useless extension candidates. Maximal degree in co-relation 27125. Up to 3859 conditions per place. [2022-12-13 07:17:41,498 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 709 selfloop transitions, 23 changer transitions 25/758 dead transitions. [2022-12-13 07:17:41,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 758 transitions, 35151 flow [2022-12-13 07:17:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:17:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:17:41,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-13 07:17:41,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 07:17:41,499 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2022-12-13 07:17:41,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 758 transitions, 35151 flow [2022-12-13 07:17:41,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 733 transitions, 33986 flow [2022-12-13 07:17:41,584 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:41,584 INFO L89 Accepts]: Start accepts. Operand has 87 places, 733 transitions, 33986 flow [2022-12-13 07:17:41,593 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:41,593 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:41,593 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 733 transitions, 33986 flow [2022-12-13 07:17:41,614 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 733 transitions, 33986 flow [2022-12-13 07:17:41,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-13 07:17:41,636 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:41,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 07:17:41,636 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 733 transitions, 33986 flow [2022-12-13 07:17:41,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:41,637 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:41,637 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] [2022-12-13 07:17:41,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 07:17:41,637 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 1 more)] === [2022-12-13 07:17:41,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:41,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2025964226, now seen corresponding path program 4 times [2022-12-13 07:17:41,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:41,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284933710] [2022-12-13 07:17:41,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:42,028 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:17:42,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:42,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284933710] [2022-12-13 07:17:42,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284933710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:42,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:42,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:17:42,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064683938] [2022-12-13 07:17:42,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:42,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:17:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:42,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:17:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:17:42,030 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 07:17:42,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 733 transitions, 33986 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:42,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:42,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 07:17:42,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:43,082 INFO L130 PetriNetUnfolder]: 2581/3840 cut-off events. [2022-12-13 07:17:43,082 INFO L131 PetriNetUnfolder]: For 28042/28982 co-relation queries the response was YES. [2022-12-13 07:17:43,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90462 conditions, 3840 events. 2581/3840 cut-off events. For 28042/28982 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 18924 event pairs, 0 based on Foata normal form. 5/3110 useless extension candidates. Maximal degree in co-relation 25860. Up to 3749 conditions per place. [2022-12-13 07:17:43,140 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 696 selfloop transitions, 21 changer transitions 25/743 dead transitions. [2022-12-13 07:17:43,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 743 transitions, 35942 flow [2022-12-13 07:17:43,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:17:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:17:43,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-13 07:17:43,151 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-13 07:17:43,151 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 55 predicate places. [2022-12-13 07:17:43,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 743 transitions, 35942 flow [2022-12-13 07:17:43,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 718 transitions, 34727 flow [2022-12-13 07:17:43,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:43,331 INFO L89 Accepts]: Start accepts. Operand has 91 places, 718 transitions, 34727 flow [2022-12-13 07:17:43,339 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:43,339 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:43,339 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 718 transitions, 34727 flow [2022-12-13 07:17:43,402 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 718 transitions, 34727 flow [2022-12-13 07:17:43,402 INFO L226 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-13 07:17:43,440 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:43,440 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 109 [2022-12-13 07:17:43,440 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 718 transitions, 34727 flow [2022-12-13 07:17:43,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:43,441 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:43,441 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] [2022-12-13 07:17:43,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 07:17:43,441 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 1 more)] === [2022-12-13 07:17:43,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1520907052, now seen corresponding path program 5 times [2022-12-13 07:17:43,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:43,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907705688] [2022-12-13 07:17:43,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:43,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:43,781 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:17:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:43,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907705688] [2022-12-13 07:17:43,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907705688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:43,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:43,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:17:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062570826] [2022-12-13 07:17:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:43,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:17:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:43,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:17:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:17:43,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 07:17:43,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 718 transitions, 34727 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:43,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:43,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 07:17:43,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:44,766 INFO L130 PetriNetUnfolder]: 2617/3894 cut-off events. [2022-12-13 07:17:44,766 INFO L131 PetriNetUnfolder]: For 30743/31767 co-relation queries the response was YES. [2022-12-13 07:17:44,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95562 conditions, 3894 events. 2617/3894 cut-off events. For 30743/31767 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 19296 event pairs, 0 based on Foata normal form. 5/3150 useless extension candidates. Maximal degree in co-relation 28384. Up to 3803 conditions per place. [2022-12-13 07:17:44,806 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 710 selfloop transitions, 23 changer transitions 13/747 dead transitions. [2022-12-13 07:17:44,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 747 transitions, 37623 flow [2022-12-13 07:17:44,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:17:44,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:17:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-13 07:17:44,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 07:17:44,808 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 59 predicate places. [2022-12-13 07:17:44,808 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 747 transitions, 37623 flow [2022-12-13 07:17:44,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 734 transitions, 36964 flow [2022-12-13 07:17:44,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:44,897 INFO L89 Accepts]: Start accepts. Operand has 96 places, 734 transitions, 36964 flow [2022-12-13 07:17:44,905 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:44,905 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:44,905 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 734 transitions, 36964 flow [2022-12-13 07:17:44,928 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 734 transitions, 36964 flow [2022-12-13 07:17:44,929 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 07:17:45,039 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:45,040 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 07:17:45,040 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 734 transitions, 36964 flow [2022-12-13 07:17:45,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:45,040 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:45,040 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] [2022-12-13 07:17:45,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 07:17:45,040 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 1 more)] === [2022-12-13 07:17:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:45,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1898535626, now seen corresponding path program 6 times [2022-12-13 07:17:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:45,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984866246] [2022-12-13 07:17:45,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:45,413 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:17:45,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:45,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984866246] [2022-12-13 07:17:45,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984866246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:45,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:45,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:17:45,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936469135] [2022-12-13 07:17:45,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:45,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 07:17:45,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:45,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 07:17:45,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 07:17:45,414 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 07:17:45,415 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 734 transitions, 36964 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:45,415 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:45,415 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 07:17:45,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:46,451 INFO L130 PetriNetUnfolder]: 2603/3866 cut-off events. [2022-12-13 07:17:46,452 INFO L131 PetriNetUnfolder]: For 33568/34676 co-relation queries the response was YES. [2022-12-13 07:17:46,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98634 conditions, 3866 events. 2603/3866 cut-off events. For 33568/34676 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 19032 event pairs, 0 based on Foata normal form. 5/3134 useless extension candidates. Maximal degree in co-relation 28889. Up to 3775 conditions per place. [2022-12-13 07:17:46,493 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 696 selfloop transitions, 23 changer transitions 13/733 dead transitions. [2022-12-13 07:17:46,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 733 transitions, 38378 flow [2022-12-13 07:17:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 07:17:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 07:17:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-12-13 07:17:46,494 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2022-12-13 07:17:46,494 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 64 predicate places. [2022-12-13 07:17:46,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 733 transitions, 38378 flow [2022-12-13 07:17:46,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 720 transitions, 37693 flow [2022-12-13 07:17:46,583 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:46,584 INFO L89 Accepts]: Start accepts. Operand has 100 places, 720 transitions, 37693 flow [2022-12-13 07:17:46,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:46,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:46,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 720 transitions, 37693 flow [2022-12-13 07:17:46,615 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 720 transitions, 37693 flow [2022-12-13 07:17:46,615 INFO L226 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-13 07:17:46,635 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:46,636 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-13 07:17:46,636 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 720 transitions, 37693 flow [2022-12-13 07:17:46,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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:17:46,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:46,636 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] [2022-12-13 07:17:46,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 07:17:46,641 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 1 more)] === [2022-12-13 07:17:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:46,642 INFO L85 PathProgramCache]: Analyzing trace with hash -998947982, now seen corresponding path program 1 times [2022-12-13 07:17:46,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:46,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574450457] [2022-12-13 07:17:46,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:46,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:46,727 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:17:46,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:46,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574450457] [2022-12-13 07:17:46,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574450457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:46,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:46,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:17:46,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134973679] [2022-12-13 07:17:46,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:46,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 07:17:46,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 07:17:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 07:17:46,729 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 36 [2022-12-13 07:17:46,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 720 transitions, 37693 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:17:46,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:46,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 36 [2022-12-13 07:17:46,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:47,784 INFO L130 PetriNetUnfolder]: 2664/3975 cut-off events. [2022-12-13 07:17:47,784 INFO L131 PetriNetUnfolder]: For 36563/37755 co-relation queries the response was YES. [2022-12-13 07:17:47,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105372 conditions, 3975 events. 2664/3975 cut-off events. For 36563/37755 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 19783 event pairs, 0 based on Foata normal form. 5/3231 useless extension candidates. Maximal degree in co-relation 29346. Up to 3884 conditions per place. [2022-12-13 07:17:47,820 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 583 selfloop transitions, 0 changer transitions 239/823 dead transitions. [2022-12-13 07:17:47,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 823 transitions, 44741 flow [2022-12-13 07:17:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 07:17:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 07:17:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-13 07:17:47,821 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2022-12-13 07:17:47,821 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-13 07:17:47,822 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 823 transitions, 44741 flow [2022-12-13 07:17:47,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 584 transitions, 31739 flow [2022-12-13 07:17:47,907 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:47,907 INFO L89 Accepts]: Start accepts. Operand has 101 places, 584 transitions, 31739 flow [2022-12-13 07:17:47,915 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:47,915 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:47,915 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 584 transitions, 31739 flow [2022-12-13 07:17:47,933 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 584 transitions, 31739 flow [2022-12-13 07:17:47,933 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 07:17:47,950 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:47,951 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-13 07:17:47,951 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 584 transitions, 31739 flow [2022-12-13 07:17:47,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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:17:47,951 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:47,951 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] [2022-12-13 07:17:47,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 07:17:47,951 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 1 more)] === [2022-12-13 07:17:47,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:47,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1006871647, now seen corresponding path program 1 times [2022-12-13 07:17:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:47,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029761398] [2022-12-13 07:17:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:47,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:47,987 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:17:47,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:47,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029761398] [2022-12-13 07:17:47,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029761398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:47,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:47,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:17:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663801525] [2022-12-13 07:17:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:47,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:17:47,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:47,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:17:47,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:17:47,989 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-13 07:17:47,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 584 transitions, 31739 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:17:47,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:47,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-13 07:17:47,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:48,457 INFO L130 PetriNetUnfolder]: 1164/1761 cut-off events. [2022-12-13 07:17:48,457 INFO L131 PetriNetUnfolder]: For 33689/33689 co-relation queries the response was YES. [2022-12-13 07:17:48,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48190 conditions, 1761 events. 1164/1761 cut-off events. For 33689/33689 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7432 event pairs, 34 based on Foata normal form. 134/1583 useless extension candidates. Maximal degree in co-relation 29187. Up to 1710 conditions per place. [2022-12-13 07:17:48,470 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 182 selfloop transitions, 0 changer transitions 228/410 dead transitions. [2022-12-13 07:17:48,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 410 transitions, 23097 flow [2022-12-13 07:17:48,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:17:48,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:17:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-13 07:17:48,472 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2022-12-13 07:17:48,472 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 66 predicate places. [2022-12-13 07:17:48,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 410 transitions, 23097 flow [2022-12-13 07:17:48,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 182 transitions, 10218 flow [2022-12-13 07:17:48,499 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:48,499 INFO L89 Accepts]: Start accepts. Operand has 80 places, 182 transitions, 10218 flow [2022-12-13 07:17:48,502 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:48,502 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:48,503 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 182 transitions, 10218 flow [2022-12-13 07:17:48,506 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 182 transitions, 10218 flow [2022-12-13 07:17:48,506 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:17:48,569 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:17:48,570 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-13 07:17:48,570 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 182 transitions, 10218 flow [2022-12-13 07:17:48,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:17:48,570 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:48,570 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] [2022-12-13 07:17:48,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 07:17:48,570 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 1 more)] === [2022-12-13 07:17:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash -110897545, now seen corresponding path program 1 times [2022-12-13 07:17:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:48,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735189615] [2022-12-13 07:17:48,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:48,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:48,661 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:17:48,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:48,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735189615] [2022-12-13 07:17:48,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735189615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:48,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:48,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 07:17:48,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797382445] [2022-12-13 07:17:48,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:48,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:17:48,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:48,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:17:48,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:17:48,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2022-12-13 07:17:48,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 182 transitions, 10218 flow. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:17:48,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:48,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2022-12-13 07:17:48,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:49,074 INFO L130 PetriNetUnfolder]: 1160/1645 cut-off events. [2022-12-13 07:17:49,075 INFO L131 PetriNetUnfolder]: For 29887/29887 co-relation queries the response was YES. [2022-12-13 07:17:49,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45851 conditions, 1645 events. 1160/1645 cut-off events. For 29887/29887 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6076 event pairs, 4 based on Foata normal form. 0/1317 useless extension candidates. Maximal degree in co-relation 44292. Up to 1646 conditions per place. [2022-12-13 07:17:49,090 INFO L137 encePairwiseOnDemand]: 31/38 looper letters, 244 selfloop transitions, 22 changer transitions 0/267 dead transitions. [2022-12-13 07:17:49,090 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 267 transitions, 15528 flow [2022-12-13 07:17:49,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:17:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:17:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-13 07:17:49,091 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2850877192982456 [2022-12-13 07:17:49,096 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 47 predicate places. [2022-12-13 07:17:49,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 267 transitions, 15528 flow [2022-12-13 07:17:49,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 267 transitions, 15528 flow [2022-12-13 07:17:49,126 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:49,126 INFO L89 Accepts]: Start accepts. Operand has 85 places, 267 transitions, 15528 flow [2022-12-13 07:17:49,131 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:49,131 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:49,131 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 267 transitions, 15528 flow [2022-12-13 07:17:49,136 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 267 transitions, 15528 flow [2022-12-13 07:17:49,136 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:17:49,918 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:17:49,919 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 793 [2022-12-13 07:17:49,919 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 266 transitions, 15470 flow [2022-12-13 07:17:49,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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:17:49,919 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:49,919 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] [2022-12-13 07:17:49,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 07:17:49,919 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 1 more)] === [2022-12-13 07:17:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:49,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1694444385, now seen corresponding path program 1 times [2022-12-13 07:17:49,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:49,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087652936] [2022-12-13 07:17:49,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:49,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:17:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:50,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087652936] [2022-12-13 07:17:50,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087652936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:50,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:50,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 07:17:50,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984843397] [2022-12-13 07:17:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:50,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:17:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:17:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 07:17:50,261 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 07:17:50,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 266 transitions, 15470 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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:17:50,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:50,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 07:17:50,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:51,298 INFO L130 PetriNetUnfolder]: 2344/3343 cut-off events. [2022-12-13 07:17:51,298 INFO L131 PetriNetUnfolder]: For 64229/64229 co-relation queries the response was YES. [2022-12-13 07:17:51,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96404 conditions, 3343 events. 2344/3343 cut-off events. For 64229/64229 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14485 event pairs, 10 based on Foata normal form. 1/2687 useless extension candidates. Maximal degree in co-relation 47431. Up to 3344 conditions per place. [2022-12-13 07:17:51,329 INFO L137 encePairwiseOnDemand]: 28/39 looper letters, 430 selfloop transitions, 72 changer transitions 74/577 dead transitions. [2022-12-13 07:17:51,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 577 transitions, 34777 flow [2022-12-13 07:17:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:17:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:17:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 171 transitions. [2022-12-13 07:17:51,331 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36538461538461536 [2022-12-13 07:17:51,331 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2022-12-13 07:17:51,331 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 577 transitions, 34777 flow [2022-12-13 07:17:51,366 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 503 transitions, 30295 flow [2022-12-13 07:17:51,393 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:51,393 INFO L89 Accepts]: Start accepts. Operand has 93 places, 503 transitions, 30295 flow [2022-12-13 07:17:51,401 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:51,402 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:51,402 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 503 transitions, 30295 flow [2022-12-13 07:17:51,411 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 503 transitions, 30295 flow [2022-12-13 07:17:51,411 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:17:52,391 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:17:52,392 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1000 [2022-12-13 07:17:52,392 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 502 transitions, 30235 flow [2022-12-13 07:17:52,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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:17:52,392 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:52,392 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] [2022-12-13 07:17:52,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 07:17:52,392 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 1 more)] === [2022-12-13 07:17:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2065674983, now seen corresponding path program 1 times [2022-12-13 07:17:52,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:52,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508836857] [2022-12-13 07:17:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:52,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:17:52,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:52,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508836857] [2022-12-13 07:17:52,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508836857] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:52,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:52,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:17:52,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499063727] [2022-12-13 07:17:52,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:52,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:17:52,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:52,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:17:52,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:17:52,809 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 07:17:52,809 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 502 transitions, 30235 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:17:52,809 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:52,809 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 07:17:52,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:54,677 INFO L130 PetriNetUnfolder]: 4753/6799 cut-off events. [2022-12-13 07:17:54,677 INFO L131 PetriNetUnfolder]: For 137666/137666 co-relation queries the response was YES. [2022-12-13 07:17:54,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202644 conditions, 6799 events. 4753/6799 cut-off events. For 137666/137666 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 33503 event pairs, 18 based on Foata normal form. 1/5519 useless extension candidates. Maximal degree in co-relation 59179. Up to 6800 conditions per place. [2022-12-13 07:17:54,761 INFO L137 encePairwiseOnDemand]: 28/40 looper letters, 1083 selfloop transitions, 43 changer transitions 20/1147 dead transitions. [2022-12-13 07:17:54,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 1147 transitions, 71458 flow [2022-12-13 07:17:54,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:17:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:17:54,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2022-12-13 07:17:54,762 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.53125 [2022-12-13 07:17:54,762 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 61 predicate places. [2022-12-13 07:17:54,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 1147 transitions, 71458 flow [2022-12-13 07:17:54,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 1127 transitions, 70209 flow [2022-12-13 07:17:54,931 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:54,932 INFO L89 Accepts]: Start accepts. Operand has 98 places, 1127 transitions, 70209 flow [2022-12-13 07:17:54,951 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:54,951 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:54,951 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 1127 transitions, 70209 flow [2022-12-13 07:17:54,975 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 1127 transitions, 70209 flow [2022-12-13 07:17:54,976 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:17:54,982 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:54,982 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 51 [2022-12-13 07:17:54,982 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 1127 transitions, 70209 flow [2022-12-13 07:17:54,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:17:54,983 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:54,983 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] [2022-12-13 07:17:54,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 07:17:54,983 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 1 more)] === [2022-12-13 07:17:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2090764163, now seen corresponding path program 2 times [2022-12-13 07:17:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:54,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247007460] [2022-12-13 07:17:54,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:17:55,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:55,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247007460] [2022-12-13 07:17:55,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247007460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:55,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:55,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:17:55,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567973618] [2022-12-13 07:17:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:55,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:17:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:55,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:17:55,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:17:55,331 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 07:17:55,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 1127 transitions, 70209 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:17:55,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:55,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 07:17:55,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:17:58,220 INFO L130 PetriNetUnfolder]: 5056/7289 cut-off events. [2022-12-13 07:17:58,221 INFO L131 PetriNetUnfolder]: For 147245/147245 co-relation queries the response was YES. [2022-12-13 07:17:58,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224860 conditions, 7289 events. 5056/7289 cut-off events. For 147245/147245 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 36998 event pairs, 18 based on Foata normal form. 2/5940 useless extension candidates. Maximal degree in co-relation 61078. Up to 7290 conditions per place. [2022-12-13 07:17:58,301 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 1169 selfloop transitions, 82 changer transitions 34/1286 dead transitions. [2022-12-13 07:17:58,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 1286 transitions, 82703 flow [2022-12-13 07:17:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:17:58,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:17:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2022-12-13 07:17:58,302 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.43125 [2022-12-13 07:17:58,302 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 67 predicate places. [2022-12-13 07:17:58,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 1286 transitions, 82703 flow [2022-12-13 07:17:58,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 1252 transitions, 80509 flow [2022-12-13 07:17:58,458 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:17:58,459 INFO L89 Accepts]: Start accepts. Operand has 103 places, 1252 transitions, 80509 flow [2022-12-13 07:17:58,490 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:17:58,490 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:17:58,491 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 1252 transitions, 80509 flow [2022-12-13 07:17:58,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 1252 transitions, 80509 flow [2022-12-13 07:17:58,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:17:58,539 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:17:58,541 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 83 [2022-12-13 07:17:58,541 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 1252 transitions, 80509 flow [2022-12-13 07:17:58,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:17:58,542 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:17:58,542 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] [2022-12-13 07:17:58,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 07:17:58,542 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 1 more)] === [2022-12-13 07:17:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:17:58,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1086201363, now seen corresponding path program 3 times [2022-12-13 07:17:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:17:58,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101409697] [2022-12-13 07:17:58,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:17:58,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:17:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:17:58,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:17:58,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:17:58,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101409697] [2022-12-13 07:17:58,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101409697] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:17:58,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:17:58,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:17:58,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116916357] [2022-12-13 07:17:58,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:17:58,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:17:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:17:58,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:17:58,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:17:58,898 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 07:17:58,898 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 1252 transitions, 80509 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:17:58,898 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:17:58,898 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 07:17:58,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:18:02,171 INFO L130 PetriNetUnfolder]: 5004/7321 cut-off events. [2022-12-13 07:18:02,171 INFO L131 PetriNetUnfolder]: For 157111/157111 co-relation queries the response was YES. [2022-12-13 07:18:02,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232908 conditions, 7321 events. 5004/7321 cut-off events. For 157111/157111 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 38479 event pairs, 16 based on Foata normal form. 2/6132 useless extension candidates. Maximal degree in co-relation 63640. Up to 7322 conditions per place. [2022-12-13 07:18:02,270 INFO L137 encePairwiseOnDemand]: 31/40 looper letters, 1160 selfloop transitions, 161 changer transitions 34/1356 dead transitions. [2022-12-13 07:18:02,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 1356 transitions, 89923 flow [2022-12-13 07:18:02,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:18:02,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:18:02,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2022-12-13 07:18:02,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3795454545454545 [2022-12-13 07:18:02,272 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 75 predicate places. [2022-12-13 07:18:02,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 1356 transitions, 89923 flow [2022-12-13 07:18:02,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 1322 transitions, 87661 flow [2022-12-13 07:18:02,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:18:02,495 INFO L89 Accepts]: Start accepts. Operand has 112 places, 1322 transitions, 87661 flow [2022-12-13 07:18:02,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:18:02,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:18:02,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 1322 transitions, 87661 flow [2022-12-13 07:18:02,543 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 1322 transitions, 87661 flow [2022-12-13 07:18:02,543 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:18:02,548 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:18:02,549 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 54 [2022-12-13 07:18:02,549 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 1322 transitions, 87661 flow [2022-12-13 07:18:02,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:18:02,549 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:18:02,549 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] [2022-12-13 07:18:02,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-13 07:18:02,549 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 1 more)] === [2022-12-13 07:18:02,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:18:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1834297381, now seen corresponding path program 4 times [2022-12-13 07:18:02,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:18:02,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574816008] [2022-12-13 07:18:02,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:18:02,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:18:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:18:02,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:18:02,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574816008] [2022-12-13 07:18:02,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574816008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:18:02,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:18:02,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:18:02,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179081539] [2022-12-13 07:18:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:18:02,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:18:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:18:02,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:18:02,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:18:02,839 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 07:18:02,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 1322 transitions, 87661 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:18:02,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:18:02,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 07:18:02,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:18:06,112 INFO L130 PetriNetUnfolder]: 4976/7293 cut-off events. [2022-12-13 07:18:06,112 INFO L131 PetriNetUnfolder]: For 167281/167281 co-relation queries the response was YES. [2022-12-13 07:18:06,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238974 conditions, 7293 events. 4976/7293 cut-off events. For 167281/167281 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 38445 event pairs, 16 based on Foata normal form. 2/6132 useless extension candidates. Maximal degree in co-relation 65083. Up to 7294 conditions per place. [2022-12-13 07:18:06,188 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 1210 selfloop transitions, 73 changer transitions 66/1350 dead transitions. [2022-12-13 07:18:06,189 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1350 transitions, 92225 flow [2022-12-13 07:18:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:18:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:18:06,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2022-12-13 07:18:06,190 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 07:18:06,190 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 81 predicate places. [2022-12-13 07:18:06,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 1350 transitions, 92225 flow [2022-12-13 07:18:06,278 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 1284 transitions, 87707 flow [2022-12-13 07:18:06,406 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:18:06,406 INFO L89 Accepts]: Start accepts. Operand has 118 places, 1284 transitions, 87707 flow [2022-12-13 07:18:06,424 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:18:06,425 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:18:06,425 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 1284 transitions, 87707 flow [2022-12-13 07:18:06,451 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 1284 transitions, 87707 flow [2022-12-13 07:18:06,451 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:18:06,455 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:18:06,456 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 07:18:06,456 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 1284 transitions, 87707 flow [2022-12-13 07:18:06,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:18:06,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:18:06,456 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] [2022-12-13 07:18:06,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 07:18:06,456 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 1 more)] === [2022-12-13 07:18:06,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:18:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1961725981, now seen corresponding path program 5 times [2022-12-13 07:18:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:18:06,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727045838] [2022-12-13 07:18:06,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:18:06,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:18:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:18:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:18:06,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727045838] [2022-12-13 07:18:06,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727045838] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:18:06,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:18:06,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 07:18:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457641349] [2022-12-13 07:18:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:18:06,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 07:18:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:18:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 07:18:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 07:18:06,765 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 07:18:06,765 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 1284 transitions, 87707 flow. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:18:06,765 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:18:06,765 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 07:18:06,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:18:10,080 INFO L130 PetriNetUnfolder]: 4892/7141 cut-off events. [2022-12-13 07:18:10,081 INFO L131 PetriNetUnfolder]: For 177747/177747 co-relation queries the response was YES. [2022-12-13 07:18:10,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240634 conditions, 7141 events. 4892/7141 cut-off events. For 177747/177747 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 37214 event pairs, 16 based on Foata normal form. 2/6016 useless extension candidates. Maximal degree in co-relation 64606. Up to 7142 conditions per place. [2022-12-13 07:18:10,164 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 1091 selfloop transitions, 156 changer transitions 34/1282 dead transitions. [2022-12-13 07:18:10,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 1282 transitions, 90133 flow [2022-12-13 07:18:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:18:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:18:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 181 transitions. [2022-12-13 07:18:10,165 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3770833333333333 [2022-12-13 07:18:10,165 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 91 predicate places. [2022-12-13 07:18:10,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 1282 transitions, 90133 flow [2022-12-13 07:18:10,261 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 1248 transitions, 87735 flow [2022-12-13 07:18:10,331 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:18:10,332 INFO L89 Accepts]: Start accepts. Operand has 127 places, 1248 transitions, 87735 flow [2022-12-13 07:18:10,355 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:18:10,355 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:18:10,355 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 1248 transitions, 87735 flow [2022-12-13 07:18:10,384 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 1248 transitions, 87735 flow [2022-12-13 07:18:10,384 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:18:10,389 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:18:10,390 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 59 [2022-12-13 07:18:10,390 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 1248 transitions, 87735 flow [2022-12-13 07:18:10,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:18:10,390 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:18:10,390 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] [2022-12-13 07:18:10,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-13 07:18:10,390 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 1 more)] === [2022-12-13 07:18:10,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:18:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1091708462, now seen corresponding path program 1 times [2022-12-13 07:18:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:18:10,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347019321] [2022-12-13 07:18:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:18:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:18:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:18:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:10,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:18:10,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347019321] [2022-12-13 07:18:10,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347019321] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:18:10,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651396099] [2022-12-13 07:18:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:18:10,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:18:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:18:10,588 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:18:10,591 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:18:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:18:10,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 07:18:10,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:18:11,146 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:18:11,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 82 [2022-12-13 07:18:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:11,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:18:11,333 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:18:11,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-12-13 07:18:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 07:18:12,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651396099] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:18:12,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:18:12,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5, 9] total 22 [2022-12-13 07:18:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077672347] [2022-12-13 07:18:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:18:12,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 07:18:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:18:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 07:18:12,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:18:12,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 40 [2022-12-13 07:18:12,391 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 1248 transitions, 87735 flow. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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:18:12,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:18:12,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 40 [2022-12-13 07:18:12,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:18:16,606 INFO L130 PetriNetUnfolder]: 5142/7554 cut-off events. [2022-12-13 07:18:16,606 INFO L131 PetriNetUnfolder]: For 188644/188644 co-relation queries the response was YES. [2022-12-13 07:18:16,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261445 conditions, 7554 events. 5142/7554 cut-off events. For 188644/188644 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 40240 event pairs, 28 based on Foata normal form. 1/6404 useless extension candidates. Maximal degree in co-relation 73665. Up to 7555 conditions per place. [2022-12-13 07:18:16,694 INFO L137 encePairwiseOnDemand]: 30/40 looper letters, 1375 selfloop transitions, 194 changer transitions 13/1583 dead transitions. [2022-12-13 07:18:16,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 1583 transitions, 114466 flow [2022-12-13 07:18:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 07:18:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 07:18:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2022-12-13 07:18:16,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38958333333333334 [2022-12-13 07:18:16,696 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 100 predicate places. [2022-12-13 07:18:16,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 1583 transitions, 114466 flow [2022-12-13 07:18:16,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 1570 transitions, 113515 flow [2022-12-13 07:18:16,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:18:16,953 INFO L89 Accepts]: Start accepts. Operand has 136 places, 1570 transitions, 113515 flow [2022-12-13 07:18:16,983 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:18:16,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:18:16,983 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 1570 transitions, 113515 flow [2022-12-13 07:18:17,026 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 1570 transitions, 113515 flow [2022-12-13 07:18:17,026 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:18:17,063 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:18:17,064 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-13 07:18:17,064 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 1570 transitions, 113515 flow [2022-12-13 07:18:17,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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:18:17,064 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:18:17,064 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] [2022-12-13 07:18:17,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-13 07:18:17,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 07:18:17,270 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 1 more)] === [2022-12-13 07:18:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:18:17,271 INFO L85 PathProgramCache]: Analyzing trace with hash -500747360, now seen corresponding path program 2 times [2022-12-13 07:18:17,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:18:17,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401869388] [2022-12-13 07:18:17,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:18:17,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:18:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:18:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:17,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:18:17,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401869388] [2022-12-13 07:18:17,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401869388] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:18:17,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709442575] [2022-12-13 07:18:17,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:18:17,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:18:17,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:18:17,512 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:18:17,560 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:18:17,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:18:17,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:18:17,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 07:18:17,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:18:18,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:18:18,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:18:18,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:18:18,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2022-12-13 07:18:19,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:19,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709442575] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:18:19,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:18:19,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 22 [2022-12-13 07:18:19,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128658747] [2022-12-13 07:18:19,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:18:19,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-12-13 07:18:19,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:18:19,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-12-13 07:18:19,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2022-12-13 07:18:19,440 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 07:18:19,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 1570 transitions, 113515 flow. Second operand has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 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:18:19,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:18:19,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 07:18:19,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:18:27,551 INFO L130 PetriNetUnfolder]: 8207/11917 cut-off events. [2022-12-13 07:18:27,551 INFO L131 PetriNetUnfolder]: For 299640/299640 co-relation queries the response was YES. [2022-12-13 07:18:27,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423467 conditions, 11917 events. 8207/11917 cut-off events. For 299640/299640 co-relation queries the response was YES. Maximal size of possible extension queue 543. Compared 66859 event pairs, 28 based on Foata normal form. 4/9963 useless extension candidates. Maximal degree in co-relation 98097. Up to 11918 conditions per place. [2022-12-13 07:18:27,657 INFO L137 encePairwiseOnDemand]: 27/42 looper letters, 1333 selfloop transitions, 191 changer transitions 892/2417 dead transitions. [2022-12-13 07:18:27,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 2417 transitions, 179604 flow [2022-12-13 07:18:27,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 07:18:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-13 07:18:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 475 transitions. [2022-12-13 07:18:27,659 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3427128427128427 [2022-12-13 07:18:27,659 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 130 predicate places. [2022-12-13 07:18:27,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 2417 transitions, 179604 flow [2022-12-13 07:18:27,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 1525 transitions, 113287 flow [2022-12-13 07:18:27,890 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:18:27,890 INFO L89 Accepts]: Start accepts. Operand has 150 places, 1525 transitions, 113287 flow [2022-12-13 07:18:27,921 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:18:27,921 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:18:27,921 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 1525 transitions, 113287 flow [2022-12-13 07:18:27,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 1525 transitions, 113287 flow [2022-12-13 07:18:27,964 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:18:38,696 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:18:38,697 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10807 [2022-12-13 07:18:38,697 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 1524 transitions, 113213 flow [2022-12-13 07:18:38,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.0) internal successors, (92), 23 states have internal predecessors, (92), 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:18:38,697 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:18:38,697 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] [2022-12-13 07:18:38,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 07:18:38,902 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,SelfDestructingSolverStorable35 [2022-12-13 07:18:38,905 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 1 more)] === [2022-12-13 07:18:38,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:18:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1009098085, now seen corresponding path program 1 times [2022-12-13 07:18:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:18:38,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498726981] [2022-12-13 07:18:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:18:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:18:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:18:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:38,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:18:38,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498726981] [2022-12-13 07:18:38,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498726981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:18:38,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:18:38,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:18:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310706351] [2022-12-13 07:18:38,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:18:38,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:18:38,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:18:38,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:18:38,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:18:38,979 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-13 07:18:38,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 1524 transitions, 113213 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:18:38,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:18:38,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-13 07:18:38,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:18:44,734 INFO L130 PetriNetUnfolder]: 8264/11910 cut-off events. [2022-12-13 07:18:44,734 INFO L131 PetriNetUnfolder]: For 349396/349396 co-relation queries the response was YES. [2022-12-13 07:18:44,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433554 conditions, 11910 events. 8264/11910 cut-off events. For 349396/349396 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 65257 event pairs, 22 based on Foata normal form. 0/9850 useless extension candidates. Maximal degree in co-relation 103181. Up to 11911 conditions per place. [2022-12-13 07:18:45,014 INFO L137 encePairwiseOnDemand]: 38/42 looper letters, 2156 selfloop transitions, 61 changer transitions 0/2217 dead transitions. [2022-12-13 07:18:45,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 2217 transitions, 169038 flow [2022-12-13 07:18:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:18:45,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:18:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2022-12-13 07:18:45,015 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-13 07:18:45,015 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 114 predicate places. [2022-12-13 07:18:45,015 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 2217 transitions, 169038 flow [2022-12-13 07:18:45,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 2217 transitions, 169038 flow [2022-12-13 07:18:45,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:18:45,301 INFO L89 Accepts]: Start accepts. Operand has 152 places, 2217 transitions, 169038 flow [2022-12-13 07:18:45,350 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:18:45,350 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:18:45,350 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 2217 transitions, 169038 flow [2022-12-13 07:18:45,409 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 2217 transitions, 169038 flow [2022-12-13 07:18:45,409 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:18:45,414 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:18:45,414 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 07:18:45,414 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 2217 transitions, 169038 flow [2022-12-13 07:18:45,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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:18:45,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:18:45,414 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] [2022-12-13 07:18:45,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-13 07:18:45,414 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:18:45,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:18:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1956817278, now seen corresponding path program 1 times [2022-12-13 07:18:45,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:18:45,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990659246] [2022-12-13 07:18:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:18:45,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:18:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:18:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:45,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:18:45,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990659246] [2022-12-13 07:18:45,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990659246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:18:45,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:18:45,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 07:18:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584197242] [2022-12-13 07:18:45,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:18:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 07:18:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:18:45,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 07:18:45,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 07:18:45,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 42 [2022-12-13 07:18:45,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 2217 transitions, 169038 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:18:45,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:18:45,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 42 [2022-12-13 07:18:45,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:18:54,882 INFO L130 PetriNetUnfolder]: 8265/11911 cut-off events. [2022-12-13 07:18:54,882 INFO L131 PetriNetUnfolder]: For 369436/369436 co-relation queries the response was YES. [2022-12-13 07:18:54,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444926 conditions, 11911 events. 8265/11911 cut-off events. For 369436/369436 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 65192 event pairs, 22 based on Foata normal form. 1/9851 useless extension candidates. Maximal degree in co-relation 105877. Up to 11912 conditions per place. [2022-12-13 07:18:55,024 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 1900 selfloop transitions, 0 changer transitions 336/2239 dead transitions. [2022-12-13 07:18:55,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 2239 transitions, 175188 flow [2022-12-13 07:18:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 07:18:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 07:18:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2022-12-13 07:18:55,025 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-13 07:18:55,026 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 119 predicate places. [2022-12-13 07:18:55,026 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 2239 transitions, 175188 flow [2022-12-13 07:18:55,190 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 1903 transitions, 148863 flow [2022-12-13 07:18:55,383 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:18:55,383 INFO L89 Accepts]: Start accepts. Operand has 153 places, 1903 transitions, 148863 flow [2022-12-13 07:18:55,415 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:18:55,415 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:18:55,415 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 1903 transitions, 148863 flow [2022-12-13 07:18:55,468 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 1903 transitions, 148863 flow [2022-12-13 07:18:55,468 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:18:55,473 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:18:55,475 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 07:18:55,475 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 1903 transitions, 148863 flow [2022-12-13 07:18:55,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:18:55,476 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:18:55,476 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] [2022-12-13 07:18:55,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 07:18:55,476 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:18:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:18:55,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1888244091, now seen corresponding path program 1 times [2022-12-13 07:18:55,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:18:55,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908713915] [2022-12-13 07:18:55,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:18:55,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:18:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:18:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 07:18:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:18:55,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908713915] [2022-12-13 07:18:55,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908713915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:18:55,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:18:55,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 07:18:55,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096264018] [2022-12-13 07:18:55,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:18:55,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 07:18:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:18:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 07:18:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 07:18:55,607 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 41 [2022-12-13 07:18:55,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 1903 transitions, 148863 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:18:55,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:18:55,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 41 [2022-12-13 07:18:55,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:19:02,445 INFO L130 PetriNetUnfolder]: 5583/8114 cut-off events. [2022-12-13 07:19:02,445 INFO L131 PetriNetUnfolder]: For 263854/263854 co-relation queries the response was YES. [2022-12-13 07:19:02,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311766 conditions, 8114 events. 5583/8114 cut-off events. For 263854/263854 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 42276 event pairs, 12 based on Foata normal form. 212/6889 useless extension candidates. Maximal degree in co-relation 108725. Up to 8115 conditions per place. [2022-12-13 07:19:02,551 INFO L137 encePairwiseOnDemand]: 38/41 looper letters, 1322 selfloop transitions, 0 changer transitions 300/1622 dead transitions. [2022-12-13 07:19:02,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 1622 transitions, 130141 flow [2022-12-13 07:19:02,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 07:19:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 07:19:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-13 07:19:02,552 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40853658536585363 [2022-12-13 07:19:02,552 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 115 predicate places. [2022-12-13 07:19:02,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 1622 transitions, 130141 flow [2022-12-13 07:19:02,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 1322 transitions, 106015 flow [2022-12-13 07:19:02,859 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:19:02,859 INFO L89 Accepts]: Start accepts. Operand has 112 places, 1322 transitions, 106015 flow [2022-12-13 07:19:02,885 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:19:02,885 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:19:02,885 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 1322 transitions, 106015 flow [2022-12-13 07:19:02,919 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 1322 transitions, 106015 flow [2022-12-13 07:19:02,920 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:19:02,923 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:19:02,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 07:19:02,924 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 1322 transitions, 106015 flow [2022-12-13 07:19:02,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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:19:02,924 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:19:02,924 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] [2022-12-13 07:19:02,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-13 07:19:02,924 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:19:02,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:19:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -957500886, now seen corresponding path program 1 times [2022-12-13 07:19:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:19:02,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987269947] [2022-12-13 07:19:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:19:02,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:19:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:19:03,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:19:03,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:19:03,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987269947] [2022-12-13 07:19:03,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987269947] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:19:03,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590889856] [2022-12-13 07:19:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:19:03,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:19:03,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:19:03,013 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:19:03,014 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:19:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:19:03,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 07:19:03,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:19:03,183 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:19:03,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:19:03,227 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:19:03,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590889856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:19:03,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:19:03,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-12-13 07:19:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428427328] [2022-12-13 07:19:03,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:19:03,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:19:03,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:19:03,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:19:03,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:19:03,228 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 39 [2022-12-13 07:19:03,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 1322 transitions, 106015 flow. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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:19:03,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:19:03,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 39 [2022-12-13 07:19:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:19:07,790 INFO L130 PetriNetUnfolder]: 5604/7980 cut-off events. [2022-12-13 07:19:07,790 INFO L131 PetriNetUnfolder]: For 296589/296589 co-relation queries the response was YES. [2022-12-13 07:19:07,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313092 conditions, 7980 events. 5604/7980 cut-off events. For 296589/296589 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 39538 event pairs, 4 based on Foata normal form. 0/6510 useless extension candidates. Maximal degree in co-relation 111421. Up to 7981 conditions per place. [2022-12-13 07:19:07,889 INFO L137 encePairwiseOnDemand]: 33/39 looper letters, 1661 selfloop transitions, 210 changer transitions 0/1874 dead transitions. [2022-12-13 07:19:07,890 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1874 transitions, 154073 flow [2022-12-13 07:19:07,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 07:19:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 07:19:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2022-12-13 07:19:07,897 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.483974358974359 [2022-12-13 07:19:07,897 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 81 predicate places. [2022-12-13 07:19:07,897 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 1874 transitions, 154073 flow [2022-12-13 07:19:08,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 1874 transitions, 154073 flow [2022-12-13 07:19:08,177 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:19:08,177 INFO L89 Accepts]: Start accepts. Operand has 119 places, 1874 transitions, 154073 flow [2022-12-13 07:19:08,216 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:19:08,216 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:19:08,216 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 1874 transitions, 154073 flow [2022-12-13 07:19:08,263 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 1874 transitions, 154073 flow [2022-12-13 07:19:08,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:19:08,269 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:19:08,271 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-13 07:19:08,271 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 1874 transitions, 154073 flow [2022-12-13 07:19:08,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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:19:08,271 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:19:08,271 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] [2022-12-13 07:19:08,275 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:19:08,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 07:19:08,475 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:19:08,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:19:08,476 INFO L85 PathProgramCache]: Analyzing trace with hash 580703970, now seen corresponding path program 1 times [2022-12-13 07:19:08,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:19:08,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639438710] [2022-12-13 07:19:08,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:19:08,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:19:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:19:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:19:08,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:19:08,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639438710] [2022-12-13 07:19:08,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639438710] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:19:08,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965011808] [2022-12-13 07:19:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:19:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:19:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:19:08,965 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:19:08,971 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:19:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:19:09,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 07:19:09,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:19:09,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:09,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-13 07:19:09,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:09,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:09,172 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 07:19:09,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-12-13 07:19:09,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 07:19:09,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:19:09,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:19:09,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:19:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:19:09,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:19:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:19:10,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965011808] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:19:10,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:19:10,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10, 12] total 32 [2022-12-13 07:19:10,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644383391] [2022-12-13 07:19:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:19:10,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:19:10,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:19:10,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:19:10,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=810, Unknown=9, NotChecked=0, Total=1056 [2022-12-13 07:19:10,096 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 39 [2022-12-13 07:19:10,097 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 1874 transitions, 154073 flow. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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:19:10,097 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:19:10,097 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 39 [2022-12-13 07:19:10,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:19:18,950 INFO L130 PetriNetUnfolder]: 8931/12714 cut-off events. [2022-12-13 07:19:18,950 INFO L131 PetriNetUnfolder]: For 411181/411181 co-relation queries the response was YES. [2022-12-13 07:19:18,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511007 conditions, 12714 events. 8931/12714 cut-off events. For 411181/411181 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 68214 event pairs, 22 based on Foata normal form. 0/10249 useless extension candidates. Maximal degree in co-relation 262582. Up to 12715 conditions per place. [2022-12-13 07:19:19,119 INFO L137 encePairwiseOnDemand]: 22/39 looper letters, 3027 selfloop transitions, 150 changer transitions 0/3177 dead transitions. [2022-12-13 07:19:19,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 3177 transitions, 266737 flow [2022-12-13 07:19:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 07:19:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 07:19:19,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 211 transitions. [2022-12-13 07:19:19,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4161735700197239 [2022-12-13 07:19:19,120 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2022-12-13 07:19:19,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 3177 transitions, 266737 flow [2022-12-13 07:19:19,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 3177 transitions, 266737 flow [2022-12-13 07:19:19,526 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:19:19,526 INFO L89 Accepts]: Start accepts. Operand has 131 places, 3177 transitions, 266737 flow [2022-12-13 07:19:19,631 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:19:19,631 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:19:19,632 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 3177 transitions, 266737 flow [2022-12-13 07:19:19,735 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 3177 transitions, 266737 flow [2022-12-13 07:19:19,736 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:19:26,741 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 07:19:26,741 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7215 [2022-12-13 07:19:26,742 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 3176 transitions, 266653 flow [2022-12-13 07:19:26,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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:19:26,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:19:26,742 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] [2022-12-13 07:19:26,748 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:19:26,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:19:26,947 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:19:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:19:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1231274843, now seen corresponding path program 1 times [2022-12-13 07:19:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:19:26,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747442382] [2022-12-13 07:19:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:19:26,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:19:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:19:28,564 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:19:28,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:19:28,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747442382] [2022-12-13 07:19:28,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747442382] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:19:28,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322389842] [2022-12-13 07:19:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:19:28,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:19:28,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:19:28,566 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:19:28,568 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:19:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:19:28,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 07:19:28,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:19:28,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:28,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:28,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:28,861 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-12-13 07:19:28,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 326 [2022-12-13 07:19:28,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 370 treesize of output 354 [2022-12-13 07:19:28,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 07:19:28,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 07:19:28,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 07:19:29,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:19:29,091 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:19:29,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:19:29,106 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-12-13 07:19:29,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 123 [2022-12-13 07:19:29,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:19:29,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:19:29,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:19:29,166 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:19:29,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 113 [2022-12-13 07:19:29,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:19:29,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,205 INFO L321 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2022-12-13 07:19:29,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 120 [2022-12-13 07:19:29,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2022-12-13 07:19:29,256 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:19:29,257 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 159 [2022-12-13 07:19:29,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,593 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-12-13 07:19:29,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 213 treesize of output 197 [2022-12-13 07:19:29,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:19:29,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:29,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 07:19:30,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:19:30,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 141 [2022-12-13 07:19:30,388 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:19:30,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:19:31,376 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:19:31,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322389842] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:19:31,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:19:31,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 33 [2022-12-13 07:19:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892668464] [2022-12-13 07:19:31,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:19:31,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:19:31,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:19:31,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:19:31,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1028, Unknown=17, NotChecked=0, Total=1190 [2022-12-13 07:19:31,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 07:19:31,377 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 3176 transitions, 266653 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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:19:31,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:19:31,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 07:19:31,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:19:48,092 INFO L130 PetriNetUnfolder]: 10351/14771 cut-off events. [2022-12-13 07:19:48,092 INFO L131 PetriNetUnfolder]: For 491979/491979 co-relation queries the response was YES. [2022-12-13 07:19:48,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608399 conditions, 14771 events. 10351/14771 cut-off events. For 491979/491979 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 81467 event pairs, 16 based on Foata normal form. 1/11831 useless extension candidates. Maximal degree in co-relation 336134. Up to 14772 conditions per place. [2022-12-13 07:19:48,302 INFO L137 encePairwiseOnDemand]: 19/40 looper letters, 3435 selfloop transitions, 312 changer transitions 10/3757 dead transitions. [2022-12-13 07:19:48,302 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 3757 transitions, 321452 flow [2022-12-13 07:19:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:19:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-13 07:19:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 194 transitions. [2022-12-13 07:19:48,303 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.303125 [2022-12-13 07:19:48,304 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 107 predicate places. [2022-12-13 07:19:48,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 3757 transitions, 321452 flow [2022-12-13 07:19:48,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 3747 transitions, 320580 flow [2022-12-13 07:19:48,873 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:19:48,874 INFO L89 Accepts]: Start accepts. Operand has 145 places, 3747 transitions, 320580 flow [2022-12-13 07:19:48,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:19:48,972 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:19:48,972 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 3747 transitions, 320580 flow [2022-12-13 07:19:49,102 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 3747 transitions, 320580 flow [2022-12-13 07:19:49,103 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:19:49,109 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:19:49,109 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-13 07:19:49,109 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 3747 transitions, 320580 flow [2022-12-13 07:19:49,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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:19:49,110 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:19:49,110 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] [2022-12-13 07:19:49,115 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:19:49,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:19:49,315 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:19:49,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:19:49,315 INFO L85 PathProgramCache]: Analyzing trace with hash -372215347, now seen corresponding path program 1 times [2022-12-13 07:19:49,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:19:49,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810371448] [2022-12-13 07:19:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:19:49,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:19:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:19:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:19:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:19:50,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810371448] [2022-12-13 07:19:50,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810371448] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:19:50,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649474841] [2022-12-13 07:19:50,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:19:50,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:19:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:19:50,566 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:19:50,568 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:19:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:19:50,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-13 07:19:50,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:19:50,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:50,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:50,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:50,828 INFO L321 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-12-13 07:19:50,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 274 [2022-12-13 07:19:50,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 426 [2022-12-13 07:19:50,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 07:19:50,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 07:19:50,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 07:19:50,978 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:19:50,979 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 417 [2022-12-13 07:19:51,075 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:19:51,076 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 225 [2022-12-13 07:19:51,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:51,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:51,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 07:19:51,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:51,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:51,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:51,090 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-12-13 07:19:51,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 86 [2022-12-13 07:19:51,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-12-13 07:19:51,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:19:51,136 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:19:51,137 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 852 [2022-12-13 07:19:51,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:51,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:51,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 385 [2022-12-13 07:19:51,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:19:52,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:52,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:52,786 INFO L321 Elim1Store]: treesize reduction 112, result has 43.1 percent of original size [2022-12-13 07:19:52,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 4413 treesize of output 3796 [2022-12-13 07:19:53,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:19:53,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 07:19:53,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:19:53,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 07:19:53,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 07:19:53,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:19:53,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 07:19:53,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:19:53,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:19:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 07:19:54,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649474841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:19:54,605 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:19:54,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-12-13 07:19:54,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824420316] [2022-12-13 07:19:54,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:19:54,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 07:19:54,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:19:54,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 07:19:54,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=833, Unknown=22, NotChecked=0, Total=992 [2022-12-13 07:19:54,606 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 40 [2022-12-13 07:19:54,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 3747 transitions, 320580 flow. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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:19:54,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:19:54,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 40 [2022-12-13 07:19:54,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:20:15,564 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 84 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 07:20:19,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:20:21,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 07:21:00,089 INFO L130 PetriNetUnfolder]: 16769/23931 cut-off events. [2022-12-13 07:21:00,089 INFO L131 PetriNetUnfolder]: For 734772/734772 co-relation queries the response was YES. [2022-12-13 07:21:00,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008927 conditions, 23931 events. 16769/23931 cut-off events. For 734772/734772 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 142596 event pairs, 12 based on Foata normal form. 0/18836 useless extension candidates. Maximal degree in co-relation 578051. Up to 23932 conditions per place. [2022-12-13 07:21:00,578 INFO L137 encePairwiseOnDemand]: 23/40 looper letters, 5717 selfloop transitions, 425 changer transitions 0/6142 dead transitions. [2022-12-13 07:21:00,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 6142 transitions, 535698 flow [2022-12-13 07:21:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 07:21:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2022-12-13 07:21:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 560 transitions. [2022-12-13 07:21:00,583 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3684210526315789 [2022-12-13 07:21:00,584 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 144 predicate places. [2022-12-13 07:21:00,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 6142 transitions, 535698 flow [2022-12-13 07:21:01,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 6142 transitions, 535698 flow [2022-12-13 07:21:01,528 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:21:01,528 INFO L89 Accepts]: Start accepts. Operand has 182 places, 6142 transitions, 535698 flow [2022-12-13 07:21:01,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:21:01,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:21:01,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 6142 transitions, 535698 flow [2022-12-13 07:21:02,107 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 6142 transitions, 535698 flow [2022-12-13 07:21:02,107 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:21:02,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] and [826] L120-4-->L121-3: Formula: (and (= |v_#pthreadsForks_20| (+ |v_#pthreadsForks_21| 1)) (= |v_#pthreadsForks_21| |v_ULTIMATE.start_main_#t~pre27#1_13|) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre27#1_13|)) |v_#memory_int_50|)) InVars {#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_13|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_13|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre25#1, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet26#1] [2022-12-13 07:21:02,209 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [793] L49-6-->L50-1: Formula: (and (< v_thread1Thread1of1ForFork0_~i~0_21 v_~n1~0_10) (< v_thread1Thread1of1ForFork0_~i~0_21 v_~n2~0_10) (= (select (select |v_#memory_int_30| v_~get1~0.base_7) (+ v_~get1~0.offset_7 (* v_thread1Thread1of1ForFork0_~i~0_21 4))) |v_thread1Thread1of1ForFork0_#t~mem2_13|)) InVars {~n2~0=v_~n2~0_10, ~n1~0=v_~n1~0_10, #memory_int=|v_#memory_int_30|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_21, ~get1~0.offset=v_~get1~0.offset_7, ~get1~0.base=v_~get1~0.base_7} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_13|, ~n2~0=v_~n2~0_10, ~n1~0=v_~n1~0_10, #memory_int=|v_#memory_int_30|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_21, ~get1~0.offset=v_~get1~0.offset_7, ~get1~0.base=v_~get1~0.base_7} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2] and [826] L120-4-->L121-3: Formula: (and (= |v_#pthreadsForks_20| (+ |v_#pthreadsForks_21| 1)) (= |v_#pthreadsForks_21| |v_ULTIMATE.start_main_#t~pre27#1_13|) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre27#1_13|)) |v_#memory_int_50|)) InVars {#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_13|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_13|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre25#1, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet26#1] [2022-12-13 07:21:02,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [836] $Ultimate##0-->L49-6: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_25 0) (= v_~count1~0_17 v_~count2~0_15) (= v_thread1Thread1of1ForFork0_~stop~0_17 0)) InVars {~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17} OutVars{~count2~0=v_~count2~0_15, ~count1~0=v_~count1~0_17, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_25, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] and [826] L120-4-->L121-3: Formula: (and (= |v_#pthreadsForks_20| (+ |v_#pthreadsForks_21| 1)) (= |v_#pthreadsForks_21| |v_ULTIMATE.start_main_#t~pre27#1_13|) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre27#1_13|)) |v_#memory_int_50|)) InVars {#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_13|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_13|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre25#1, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet26#1] [2022-12-13 07:21:02,363 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [1113] $Ultimate##0-->L50-1: Formula: (and (= v_thread1Thread1of1ForFork0_~i~0_116 0) (= (select (select |v_#memory_int_509| v_~get1~0.base_126) (+ v_~get1~0.offset_126 (* v_thread1Thread1of1ForFork0_~i~0_116 4))) |v_thread1Thread1of1ForFork0_#t~mem2_76|) (= v_thread1Thread1of1ForFork0_~stop~0_49 0) (= v_~count1~0_91 v_~count2~0_87) (< v_thread1Thread1of1ForFork0_~i~0_116 v_~n1~0_108) (< v_thread1Thread1of1ForFork0_~i~0_116 v_~n2~0_128)) InVars {~n2~0=v_~n2~0_128, ~n1~0=v_~n1~0_108, ~count2~0=v_~count2~0_87, ~count1~0=v_~count1~0_91, #memory_int=|v_#memory_int_509|, ~get1~0.offset=v_~get1~0.offset_126, ~get1~0.base=v_~get1~0.base_126} OutVars{thread1Thread1of1ForFork0_#t~mem2=|v_thread1Thread1of1ForFork0_#t~mem2_76|, ~n2~0=v_~n2~0_128, ~n1~0=v_~n1~0_108, ~count2~0=v_~count2~0_87, ~count1~0=v_~count1~0_91, #memory_int=|v_#memory_int_509|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_116, thread1Thread1of1ForFork0_~stop~0=v_thread1Thread1of1ForFork0_~stop~0_49, ~get1~0.offset=v_~get1~0.offset_126, ~get1~0.base=v_~get1~0.base_126} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_~stop~0] and [826] L120-4-->L121-3: Formula: (and (= |v_#pthreadsForks_20| (+ |v_#pthreadsForks_21| 1)) (= |v_#pthreadsForks_21| |v_ULTIMATE.start_main_#t~pre27#1_13|) (= (store |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_51| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre27#1_13|)) |v_#memory_int_50|)) InVars {#pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_51|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{#pthreadsForks=|v_#pthreadsForks_20|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre25#1=|v_ULTIMATE.start_main_#t~pre25#1_13|, #memory_int=|v_#memory_int_50|, ULTIMATE.start_main_#t~pre27#1=|v_ULTIMATE.start_main_#t~pre27#1_13|, ULTIMATE.start_main_#t~nondet26#1=|v_ULTIMATE.start_main_#t~nondet26#1_9|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[#pthreadsForks, ULTIMATE.start_main_#t~pre25#1, #memory_int, ULTIMATE.start_main_#t~pre27#1, ULTIMATE.start_main_#t~nondet26#1] [2022-12-13 07:21:02,490 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 07:21:02,491 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 963 [2022-12-13 07:21:02,491 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 6138 transitions, 535354 flow [2022-12-13 07:21:02,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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:21:02,491 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:21:02,492 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] [2022-12-13 07:21:02,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 07:21:02,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:02,697 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:21:02,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:21:02,698 INFO L85 PathProgramCache]: Analyzing trace with hash 159830455, now seen corresponding path program 2 times [2022-12-13 07:21:02,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:21:02,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915964069] [2022-12-13 07:21:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:21:02,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:21:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:21:04,189 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:21:04,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:21:04,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915964069] [2022-12-13 07:21:04,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915964069] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:04,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460232884] [2022-12-13 07:21:04,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 07:21:04,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:21:04,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:21:04,191 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:21:04,193 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:21:04,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 07:21:04,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 07:21:04,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-13 07:21:04,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:21:04,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:21:04,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:21:04,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:21:04,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:21:04,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:21:04,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:21:04,404 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-12-13 07:21:04,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 32 [2022-12-13 07:21:04,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 07:21:04,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:21:04,422 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 07:21:04,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 360 treesize of output 350 [2022-12-13 07:21:04,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 07:21:04,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 07:21:05,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 07:21:05,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 117 treesize of output 141 [2022-12-13 07:21:05,632 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:21:05,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:21:07,265 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:21:07,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460232884] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 07:21:07,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 07:21:07,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11, 11] total 32 [2022-12-13 07:21:07,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741796726] [2022-12-13 07:21:07,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:21:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:21:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:21:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:21:07,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=944, Unknown=17, NotChecked=0, Total=1122 [2022-12-13 07:21:07,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 07:21:07,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 6138 transitions, 535354 flow. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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:21:07,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:21:07,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 07:21:07,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:22:26,789 INFO L130 PetriNetUnfolder]: 18500/26465 cut-off events. [2022-12-13 07:22:26,789 INFO L131 PetriNetUnfolder]: For 712790/712790 co-relation queries the response was YES. [2022-12-13 07:22:26,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142213 conditions, 26465 events. 18500/26465 cut-off events. For 712790/712790 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 160527 event pairs, 8 based on Foata normal form. 3/20769 useless extension candidates. Maximal degree in co-relation 675891. Up to 26466 conditions per place. [2022-12-13 07:22:27,232 INFO L137 encePairwiseOnDemand]: 22/46 looper letters, 5822 selfloop transitions, 1111 changer transitions 66/6999 dead transitions. [2022-12-13 07:22:27,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 6999 transitions, 621660 flow [2022-12-13 07:22:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 07:22:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-13 07:22:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 240 transitions. [2022-12-13 07:22:27,234 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.23715415019762845 [2022-12-13 07:22:27,234 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 160 predicate places. [2022-12-13 07:22:27,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 6999 transitions, 621660 flow [2022-12-13 07:22:27,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 6933 transitions, 615684 flow [2022-12-13 07:22:28,397 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:22:28,398 INFO L89 Accepts]: Start accepts. Operand has 197 places, 6933 transitions, 615684 flow [2022-12-13 07:22:28,596 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:22:28,596 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:22:28,596 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 6933 transitions, 615684 flow [2022-12-13 07:22:28,965 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 6933 transitions, 615684 flow [2022-12-13 07:22:28,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:22:28,979 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:22:28,979 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 582 [2022-12-13 07:22:28,979 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 6933 transitions, 615684 flow [2022-12-13 07:22:28,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 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:22:28,979 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:22:28,980 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] [2022-12-13 07:22:28,997 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:22:29,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:22:29,186 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:22:29,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:22:29,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1535949439, now seen corresponding path program 1 times [2022-12-13 07:22:29,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:22:29,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119232699] [2022-12-13 07:22:29,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:22:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:22:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:22:29,931 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:22:29,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:22:29,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119232699] [2022-12-13 07:22:29,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119232699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:22:29,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:22:29,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 07:22:29,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869935758] [2022-12-13 07:22:29,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:22:29,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 07:22:29,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:22:29,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 07:22:29,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-12-13 07:22:29,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 07:22:29,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 6933 transitions, 615684 flow. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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:22:29,933 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:22:29,933 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 07:22:29,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:24:03,962 INFO L130 PetriNetUnfolder]: 18680/26709 cut-off events. [2022-12-13 07:24:03,962 INFO L131 PetriNetUnfolder]: For 723275/723275 co-relation queries the response was YES. [2022-12-13 07:24:04,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179318 conditions, 26709 events. 18680/26709 cut-off events. For 723275/723275 co-relation queries the response was YES. Maximal size of possible extension queue 1180. Compared 162323 event pairs, 22 based on Foata normal form. 1/20953 useless extension candidates. Maximal degree in co-relation 699681. Up to 26710 conditions per place. [2022-12-13 07:24:04,536 INFO L137 encePairwiseOnDemand]: 32/46 looper letters, 6972 selfloop transitions, 63 changer transitions 22/7057 dead transitions. [2022-12-13 07:24:04,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 7057 transitions, 640849 flow [2022-12-13 07:24:04,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 07:24:04,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 07:24:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2022-12-13 07:24:04,537 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2022-12-13 07:24:04,537 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 167 predicate places. [2022-12-13 07:24:04,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 7057 transitions, 640849 flow [2022-12-13 07:24:05,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 7035 transitions, 638813 flow [2022-12-13 07:24:05,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:24:05,761 INFO L89 Accepts]: Start accepts. Operand has 203 places, 7035 transitions, 638813 flow [2022-12-13 07:24:05,997 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:24:05,998 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:24:05,998 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 7035 transitions, 638813 flow [2022-12-13 07:24:06,391 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 7035 transitions, 638813 flow [2022-12-13 07:24:06,391 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:24:06,408 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:24:06,408 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 648 [2022-12-13 07:24:06,408 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 7035 transitions, 638813 flow [2022-12-13 07:24:06,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 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:24:06,409 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:24:06,409 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] [2022-12-13 07:24:06,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-12-13 07:24:06,409 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:24:06,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:24:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash -928192158, now seen corresponding path program 1 times [2022-12-13 07:24:06,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:24:06,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633180845] [2022-12-13 07:24:06,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:24:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:24:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:24:07,508 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:24:07,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:24:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633180845] [2022-12-13 07:24:07,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633180845] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 07:24:07,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703647333] [2022-12-13 07:24:07,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:24:07,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 07:24:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 07:24:07,511 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:24:07,512 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:24:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:24:07,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 07:24:07,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 07:24:07,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-12-13 07:24:07,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,724 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 07:24:07,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 34 [2022-12-13 07:24:07,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 07:24:07,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 07:24:07,750 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 07:24:07,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 442 [2022-12-13 07:24:07,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:07,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 07:24:08,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 07:24:08,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 23 [2022-12-13 07:24:08,379 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:24:08,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 07:24:08,909 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:24:08,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703647333] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 07:24:08,909 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 07:24:08,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2022-12-13 07:24:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579930160] [2022-12-13 07:24:08,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 07:24:08,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 07:24:08,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:24:08,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 07:24:08,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=532, Unknown=21, NotChecked=0, Total=650 [2022-12-13 07:24:08,911 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 07:24:08,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 7035 transitions, 638813 flow. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 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:24:08,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:24:08,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 07:24:08,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:26:08,579 INFO L130 PetriNetUnfolder]: 19566/28016 cut-off events. [2022-12-13 07:26:08,579 INFO L131 PetriNetUnfolder]: For 765236/765236 co-relation queries the response was YES. [2022-12-13 07:26:08,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267535 conditions, 28016 events. 19566/28016 cut-off events. For 765236/765236 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 171765 event pairs, 16 based on Foata normal form. 0/21959 useless extension candidates. Maximal degree in co-relation 760959. Up to 28017 conditions per place. [2022-12-13 07:26:09,071 INFO L137 encePairwiseOnDemand]: 28/46 looper letters, 7330 selfloop transitions, 267 changer transitions 0/7597 dead transitions. [2022-12-13 07:26:09,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 7597 transitions, 705903 flow [2022-12-13 07:26:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 07:26:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-13 07:26:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 264 transitions. [2022-12-13 07:26:09,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3826086956521739 [2022-12-13 07:26:09,073 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 179 predicate places. [2022-12-13 07:26:09,073 INFO L82 GeneralOperation]: Start removeDead. Operand has 217 places, 7597 transitions, 705903 flow [2022-12-13 07:26:09,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 217 places, 7597 transitions, 705903 flow [2022-12-13 07:26:10,283 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:26:10,284 INFO L89 Accepts]: Start accepts. Operand has 217 places, 7597 transitions, 705903 flow [2022-12-13 07:26:10,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:26:10,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:26:10,884 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 7597 transitions, 705903 flow [2022-12-13 07:26:11,299 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 7597 transitions, 705903 flow [2022-12-13 07:26:11,300 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:26:11,314 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:26:11,314 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1031 [2022-12-13 07:26:11,314 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 7597 transitions, 705903 flow [2022-12-13 07:26:11,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 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:26:11,315 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:26:11,315 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] [2022-12-13 07:26:11,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-13 07:26:11,520 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,SelfDestructingSolverStorable45 [2022-12-13 07:26:11,520 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:26:11,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:26:11,521 INFO L85 PathProgramCache]: Analyzing trace with hash -666669854, now seen corresponding path program 1 times [2022-12-13 07:26:11,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:26:11,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506377014] [2022-12-13 07:26:11,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:26:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:26:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:26:13,382 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:26:13,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:26:13,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506377014] [2022-12-13 07:26:13,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506377014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:26:13,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:26:13,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 07:26:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703248033] [2022-12-13 07:26:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:26:13,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 07:26:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:26:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 07:26:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-13 07:26:13,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 07:26:13,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 7597 transitions, 705903 flow. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:26:13,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:26:13,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 07:26:13,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 07:28:17,623 INFO L130 PetriNetUnfolder]: 22912/32864 cut-off events. [2022-12-13 07:28:17,623 INFO L131 PetriNetUnfolder]: For 831194/831194 co-relation queries the response was YES. [2022-12-13 07:28:17,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1519215 conditions, 32864 events. 22912/32864 cut-off events. For 831194/831194 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 207740 event pairs, 24 based on Foata normal form. 2/25665 useless extension candidates. Maximal degree in co-relation 948087. Up to 32865 conditions per place. [2022-12-13 07:28:18,238 INFO L137 encePairwiseOnDemand]: 29/46 looper letters, 8726 selfloop transitions, 326 changer transitions 44/9096 dead transitions. [2022-12-13 07:28:18,239 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 9096 transitions, 864029 flow [2022-12-13 07:28:18,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 07:28:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 07:28:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 183 transitions. [2022-12-13 07:28:18,240 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3616600790513834 [2022-12-13 07:28:18,240 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 189 predicate places. [2022-12-13 07:28:18,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 227 places, 9096 transitions, 864029 flow [2022-12-13 07:28:19,117 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 9052 transitions, 859781 flow [2022-12-13 07:28:19,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 07:28:19,775 INFO L89 Accepts]: Start accepts. Operand has 225 places, 9052 transitions, 859781 flow [2022-12-13 07:28:20,065 INFO L95 Accepts]: Finished accepts. [2022-12-13 07:28:20,065 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 07:28:20,065 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 9052 transitions, 859781 flow [2022-12-13 07:28:20,605 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 9052 transitions, 859781 flow [2022-12-13 07:28:20,605 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 07:28:20,626 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 07:28:20,627 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 852 [2022-12-13 07:28:20,627 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 9052 transitions, 859781 flow [2022-12-13 07:28:20,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 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:28:20,627 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 07:28:20,627 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] [2022-12-13 07:28:20,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-13 07:28:20,627 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 07:28:20,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 07:28:20,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1589509653, now seen corresponding path program 1 times [2022-12-13 07:28:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 07:28:20,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311381623] [2022-12-13 07:28:20,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 07:28:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 07:28:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 07:28:21,811 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:28:21,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 07:28:21,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311381623] [2022-12-13 07:28:21,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311381623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 07:28:21,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 07:28:21,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 07:28:21,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390348722] [2022-12-13 07:28:21,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 07:28:21,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 07:28:21,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 07:28:21,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 07:28:21,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-13 07:28:21,812 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 46 [2022-12-13 07:28:21,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 9052 transitions, 859781 flow. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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:28:21,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 07:28:21,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 46 [2022-12-13 07:28:21,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-13 07:30:39,501 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 07:30:39,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 07:30:39,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 07:30:39,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-13 07:30:39,548 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 1476298 conditions, 31241 events (22088/31240 cut-off events. For 833354/833354 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 198701 event pairs, 15 based on Foata normal form. 0/24673 useless extension candidates. Maximal degree in co-relation 999439. Up to 31241 conditions per place.). [2022-12-13 07:30:39,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 07:30:39,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 07:30:39,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 07:30:39,550 INFO L445 BasicCegarLoop]: Path program histogram: [6, 6, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 07:30:39,552 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 07:30:39,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 07:30:39,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 07:30:39 BasicIcfg [2022-12-13 07:30:39,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 07:30:39,555 INFO L158 Benchmark]: Toolchain (without parser) took 814523.49ms. Allocated memory was 195.0MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 172.0MB in the beginning and 1.1GB in the end (delta: -937.2MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-13 07:30:39,555 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 172.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 07:30:39,558 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.43ms. Allocated memory is still 195.0MB. Free memory was 171.8MB in the beginning and 159.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-13 07:30:39,558 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.62ms. Allocated memory is still 195.0MB. Free memory was 159.2MB in the beginning and 157.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:30:39,559 INFO L158 Benchmark]: Boogie Preprocessor took 44.48ms. Allocated memory is still 195.0MB. Free memory was 157.1MB in the beginning and 155.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 07:30:39,559 INFO L158 Benchmark]: RCFGBuilder took 481.79ms. Allocated memory is still 195.0MB. Free memory was 155.0MB in the beginning and 131.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-13 07:30:39,559 INFO L158 Benchmark]: TraceAbstraction took 813694.83ms. Allocated memory was 195.0MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 130.3MB in the beginning and 1.1GB in the end (delta: -978.9MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-12-13 07:30:39,560 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.10ms. Allocated memory is still 195.0MB. Free memory is still 172.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.43ms. Allocated memory is still 195.0MB. Free memory was 171.8MB in the beginning and 159.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.62ms. Allocated memory is still 195.0MB. Free memory was 159.2MB in the beginning and 157.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.48ms. Allocated memory is still 195.0MB. Free memory was 157.1MB in the beginning and 155.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 481.79ms. Allocated memory is still 195.0MB. Free memory was 155.0MB in the beginning and 131.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 813694.83ms. Allocated memory was 195.0MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 130.3MB in the beginning and 1.1GB in the end (delta: -978.9MB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 256 PlacesBefore, 38 PlacesAfterwards, 275 TransitionsBefore, 39 TransitionsAfterwards, 7560 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 143 TrivialYvCompositions, 75 ConcurrentYvCompositions, 17 ChoiceCompositions, 235 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 5189, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5253, independent: 5189, independent conditional: 0, independent unconditional: 5189, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4551, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4551, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5253, independent: 680, independent conditional: 0, independent unconditional: 680, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 4551, unknown conditional: 0, unknown unconditional: 4551] , Statistics on independence cache: Total cache size (in pairs): 7944, Positive cache size: 7902, Positive conditional cache size: 0, Positive unconditional cache size: 7902, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 37 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 4, Positive cache size: 3, Positive conditional cache size: 0, Positive unconditional cache size: 3, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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, 66 TransitionsBefore, 66 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, independent: 30, independent conditional: 30, 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: 33, independent: 30, independent conditional: 15, independent unconditional: 15, 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: 33, independent: 30, independent conditional: 6, independent unconditional: 24, 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: 33, independent: 30, independent conditional: 6, independent unconditional: 24, 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: 14, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 17, independent conditional: 4, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 14, unknown conditional: 2, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 16, Positive conditional cache size: 2, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 56 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 49, independent unconditional: 7, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 63, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 63, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 63, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 149 TransitionsBefore, 149 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 68 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 90, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 99, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 99, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 173 TransitionsBefore, 173 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 182, independent: 169, independent conditional: 169, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 182, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 182, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 182, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 162 TransitionsBefore, 162 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221, independent: 208, independent conditional: 208, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 221, independent: 208, independent conditional: 195, independent unconditional: 13, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 26, dependent conditional: 0, dependent unconditional: 26, 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: 234, independent: 208, independent conditional: 0, independent unconditional: 208, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 221, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 263 TransitionsBefore, 263 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 102, independent conditional: 17, independent unconditional: 85, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 102, independent conditional: 17, independent unconditional: 85, dependent: 51, dependent conditional: 0, dependent unconditional: 51, 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: 153, independent: 102, independent conditional: 17, independent unconditional: 85, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 136, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 280 TransitionsBefore, 280 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 54, dependent conditional: 0, dependent unconditional: 54, 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: 126, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 126, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 274 TransitionsBefore, 274 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 126, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 72, dependent conditional: 0, dependent unconditional: 72, 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: 180, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 180, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 251 TransitionsBefore, 251 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 85, independent conditional: 85, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 68, dependent conditional: 0, dependent unconditional: 68, 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: 153, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 153, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 71 PlacesBefore, 71 PlacesAfterwards, 279 TransitionsBefore, 279 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 85, dependent conditional: 0, dependent unconditional: 85, 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: 187, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 187, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 275 TransitionsBefore, 275 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 80, independent conditional: 16, independent unconditional: 64, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 80, independent conditional: 16, independent unconditional: 64, dependent: 96, dependent conditional: 0, dependent unconditional: 96, 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: 176, independent: 80, independent conditional: 16, independent unconditional: 64, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 160, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 135, independent: 45, independent conditional: 30, independent unconditional: 15, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 45, independent conditional: 30, independent unconditional: 15, dependent: 90, dependent conditional: 0, dependent unconditional: 90, 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: 135, independent: 45, independent conditional: 30, independent unconditional: 15, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 90, independent: 75, independent conditional: 75, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 90, dependent conditional: 0, dependent unconditional: 90, 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: 165, independent: 75, independent conditional: 0, independent unconditional: 75, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 165, Maximal queried relation: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 74 PlacesBefore, 74 PlacesAfterwards, 207 TransitionsBefore, 207 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 135, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 135, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 225, independent: 120, independent conditional: 30, independent unconditional: 90, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 225, independent: 120, independent conditional: 30, independent unconditional: 90, dependent: 105, dependent conditional: 0, dependent unconditional: 105, 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: 225, independent: 120, independent conditional: 30, independent unconditional: 90, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 195, Maximal queried relation: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 204, independent: 192, independent conditional: 192, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 192, independent conditional: 48, independent unconditional: 144, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 192, independent conditional: 48, independent unconditional: 144, dependent: 84, dependent conditional: 0, dependent unconditional: 84, 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: 276, independent: 192, independent conditional: 48, independent unconditional: 144, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 228, Maximal queried relation: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8s, 75 PlacesBefore, 72 PlacesAfterwards, 315 TransitionsBefore, 312 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1248, independent: 1200, independent conditional: 1200, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1248, independent: 1200, independent conditional: 1200, independent unconditional: 0, dependent: 48, dependent conditional: 48, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1584, independent: 1200, independent conditional: 288, independent unconditional: 912, dependent: 384, dependent conditional: 0, dependent unconditional: 384, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1584, independent: 1200, independent conditional: 288, independent unconditional: 912, dependent: 384, dependent conditional: 0, dependent unconditional: 384, 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: 1584, independent: 1200, independent conditional: 288, independent unconditional: 912, dependent: 384, dependent conditional: 0, dependent unconditional: 384, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1296, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 75 PlacesBefore, 74 PlacesAfterwards, 491 TransitionsBefore, 490 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 864, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 864, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1368, independent: 792, independent conditional: 144, independent unconditional: 648, dependent: 576, dependent conditional: 0, dependent unconditional: 576, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1368, independent: 792, independent conditional: 144, independent unconditional: 648, dependent: 576, dependent conditional: 0, dependent unconditional: 576, 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: 1368, independent: 792, independent conditional: 144, independent unconditional: 648, dependent: 576, dependent conditional: 0, dependent unconditional: 576, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 22, Positive conditional cache size: 2, Positive unconditional cache size: 20, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1224, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 648 TransitionsBefore, 648 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1276, independent: 1232, independent conditional: 1232, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1276, independent: 1232, independent conditional: 1232, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1584, independent: 1232, independent conditional: 88, independent unconditional: 1144, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1584, independent: 1232, independent conditional: 88, independent unconditional: 1144, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 1584, independent: 1230, independent conditional: 88, independent unconditional: 1142, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1496, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 751 TransitionsBefore, 751 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1404, independent: 1350, independent conditional: 1350, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1404, independent: 1350, independent conditional: 1350, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1782, independent: 1350, independent conditional: 270, independent unconditional: 1080, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1782, independent: 1350, independent conditional: 270, independent unconditional: 1080, dependent: 432, dependent conditional: 0, dependent unconditional: 432, 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: 1782, independent: 1350, independent conditional: 270, independent unconditional: 1080, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1512, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 733 TransitionsBefore, 733 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1458, independent: 1404, independent conditional: 1404, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1458, independent: 1404, independent conditional: 1404, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1836, independent: 1404, independent conditional: 270, independent unconditional: 1134, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1836, independent: 1404, independent conditional: 270, independent unconditional: 1134, dependent: 432, dependent conditional: 0, dependent unconditional: 432, 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: 1836, independent: 1404, independent conditional: 270, independent unconditional: 1134, dependent: 432, dependent conditional: 0, dependent unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1566, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 91 PlacesBefore, 91 PlacesAfterwards, 718 TransitionsBefore, 718 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1456, independent: 1404, independent conditional: 1404, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1456, independent: 1404, independent conditional: 1404, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1820, independent: 1404, independent conditional: 260, independent unconditional: 1144, dependent: 416, dependent conditional: 0, dependent unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1820, independent: 1404, independent conditional: 260, independent unconditional: 1144, dependent: 416, dependent conditional: 0, dependent unconditional: 416, 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: 1820, independent: 1404, independent conditional: 260, independent unconditional: 1144, dependent: 416, dependent conditional: 0, dependent unconditional: 416, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1560, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 96 PlacesBefore, 96 PlacesAfterwards, 734 TransitionsBefore, 734 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 560, independent: 504, independent conditional: 504, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 560, independent: 504, independent conditional: 504, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 952, independent: 504, independent conditional: 112, independent unconditional: 392, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 952, independent: 504, independent conditional: 112, independent unconditional: 392, dependent: 448, dependent conditional: 0, dependent unconditional: 448, 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: 952, independent: 504, independent conditional: 112, independent unconditional: 392, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 840, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 100 PlacesBefore, 100 PlacesAfterwards, 720 TransitionsBefore, 720 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 728, independent: 672, independent conditional: 672, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 728, independent: 672, independent conditional: 672, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1120, independent: 672, independent conditional: 112, independent unconditional: 560, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1120, independent: 672, independent conditional: 112, independent unconditional: 560, dependent: 448, dependent conditional: 0, dependent unconditional: 448, 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: 1120, independent: 672, independent conditional: 112, independent unconditional: 560, dependent: 448, dependent conditional: 0, dependent unconditional: 448, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1008, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 101 PlacesBefore, 101 PlacesAfterwards, 584 TransitionsBefore, 584 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 836, independent: 792, independent conditional: 792, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1144, independent: 792, independent conditional: 220, independent unconditional: 572, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1144, independent: 792, independent conditional: 220, independent unconditional: 572, dependent: 352, dependent conditional: 0, dependent unconditional: 352, 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: 1144, independent: 792, independent conditional: 220, independent unconditional: 572, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 924, Maximal queried relation: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 80 PlacesBefore, 80 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.8s, 85 PlacesBefore, 84 PlacesAfterwards, 267 TransitionsBefore, 266 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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: 1.0s, 93 PlacesBefore, 92 PlacesAfterwards, 503 TransitionsBefore, 502 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 98 PlacesBefore, 98 PlacesAfterwards, 1127 TransitionsBefore, 1127 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 103 PlacesBefore, 103 PlacesAfterwards, 1252 TransitionsBefore, 1252 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 112 PlacesBefore, 112 PlacesAfterwards, 1322 TransitionsBefore, 1322 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 118 PlacesBefore, 118 PlacesAfterwards, 1284 TransitionsBefore, 1284 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 127 PlacesBefore, 127 PlacesAfterwards, 1248 TransitionsBefore, 1248 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 1570 TransitionsBefore, 1570 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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: 10.7s, 150 PlacesBefore, 149 PlacesAfterwards, 1525 TransitionsBefore, 1524 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 152 PlacesBefore, 152 PlacesAfterwards, 2217 TransitionsBefore, 2217 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 1903 TransitionsBefore, 1903 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 112 PlacesBefore, 112 PlacesAfterwards, 1322 TransitionsBefore, 1322 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 119 PlacesBefore, 119 PlacesAfterwards, 1874 TransitionsBefore, 1874 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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: 7.0s, 131 PlacesBefore, 130 PlacesAfterwards, 3177 TransitionsBefore, 3176 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 3747 TransitionsBefore, 3747 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): 26, Positive cache size: 24, Positive conditional cache size: 2, Positive unconditional cache size: 22, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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.4s, 182 PlacesBefore, 177 PlacesAfterwards, 6142 TransitionsBefore, 6138 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 197 PlacesBefore, 197 PlacesAfterwards, 6933 TransitionsBefore, 6933 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 203 PlacesBefore, 203 PlacesAfterwards, 7035 TransitionsBefore, 7035 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 217 PlacesBefore, 217 PlacesAfterwards, 7597 TransitionsBefore, 7597 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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, 225 PlacesBefore, 225 PlacesAfterwards, 9052 TransitionsBefore, 9052 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): 34, Positive cache size: 32, Positive conditional cache size: 2, Positive unconditional cache size: 30, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (11states, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 1476298 conditions, 31241 events (22088/31240 cut-off events. For 833354/833354 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 198701 event pairs, 15 based on Foata normal form. 0/24673 useless extension candidates. Maximal degree in co-relation 999439. Up to 31241 conditions per place.). - TimeoutResultAtElement [Line: 120]: 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, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 1476298 conditions, 31241 events (22088/31240 cut-off events. For 833354/833354 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 198701 event pairs, 15 based on Foata normal form. 0/24673 useless extension candidates. Maximal degree in co-relation 999439. Up to 31241 conditions per place.). - TimeoutResultAtElement [Line: 121]: 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, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 1476298 conditions, 31241 events (22088/31240 cut-off events. For 833354/833354 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 198701 event pairs, 15 based on Foata normal form. 0/24673 useless extension candidates. Maximal degree in co-relation 999439. Up to 31241 conditions per place.). - TimeoutResultAtElement [Line: 122]: 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, 0/46 universal loopers) in iteration 48,while PetriNetUnfolder was constructing finite prefix that currently has 1476298 conditions, 31241 events (22088/31240 cut-off events. For 833354/833354 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 198701 event pairs, 15 based on Foata normal form. 0/24673 useless extension candidates. Maximal degree in co-relation 999439. Up to 31241 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 341 locations, 4 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: 813.6s, OverallIterations: 48, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 719.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.2s, HoareTripleCheckerStatistics: 731 mSolverCounterUnknown, 6562 SdHoareTripleChecker+Valid, 24.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6562 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 22.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 301 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22704 IncrementalHoareTripleChecker+Invalid, 23736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 301 mSolverCounterUnsat, 4 mSDtfsCounter, 22704 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 731 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 854 GetRequests, 277 SyntacticMatches, 5 SemanticMatches, 572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4038 ImplicationChecksByTransitivity, 58.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=859781occurred in iteration=47, InterpolantAutomatonStates: 403, 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.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 32.5s InterpolantComputationTime, 1210 NumberOfCodeBlocks, 1210 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1330 ConstructedInterpolants, 63 QuantifiedInterpolants, 35336 SizeOfPredicates, 222 NumberOfNonLiveVariables, 2412 ConjunctsInSsa, 375 ConjunctsInUnsatCore, 64 InterpolantComputations, 44 PerfectInterpolantSequences, 21/45 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