/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:09:52,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:09:52,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:09:52,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:09:52,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:09:52,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:09:52,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:09:52,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:09:52,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:09:52,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:09:52,340 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:09:52,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:09:52,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:09:52,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:09:52,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:09:52,343 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:09:52,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:09:52,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:09:52,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:09:52,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:09:52,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:09:52,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:09:52,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:09:52,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:09:52,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:09:52,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:09:52,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:09:52,353 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:09:52,353 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:09:52,354 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:09:52,354 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:09:52,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:09:52,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:09:52,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:09:52,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:09:52,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:09:52,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:09:52,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:09:52,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:09:52,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:09:52,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:09:52,361 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:09:52,399 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:09:52,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:09:52,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:09:52,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:09:52,400 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:09:52,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:09:52,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:09:52,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:09:52,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:09:52,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:09:52,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:09:52,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:09:52,402 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:09:52,402 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:09:52,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:09:52,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:09:52,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:09:52,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:09:52,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:09:52,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:09:52,403 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:09:52,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:52,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:09:52,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:09:52,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:09:52,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:09:52,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:09:52,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:09:52,404 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 [2022-12-06 04:09:52,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:09:52,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:09:52,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:09:52,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:09:52,697 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:09:52,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-06 04:09:53,738 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:09:54,007 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:09:54,008 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-06 04:09:54,033 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03bf25d5/a2501da07ec2429a87dfd2e9cb30b6eb/FLAGca48e3c7c [2022-12-06 04:09:54,047 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a03bf25d5/a2501da07ec2429a87dfd2e9cb30b6eb [2022-12-06 04:09:54,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:09:54,049 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:09:54,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:54,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:09:54,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:09:54,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1904e570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54, skipping insertion in model container [2022-12-06 04:09:54,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:09:54,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:09:54,246 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i[949,962] [2022-12-06 04:09:54,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,404 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:54,450 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:09:54,459 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i[949,962] [2022-12-06 04:09:54,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:09:54,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:09:54,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:09:54,554 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:09:54,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54 WrapperNode [2022-12-06 04:09:54,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:09:54,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:54,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:09:54,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:09:54,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,614 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-06 04:09:54,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:09:54,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:09:54,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:09:54,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:09:54,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,643 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:09:54,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:09:54,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:09:54,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:09:54,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (1/1) ... [2022-12-06 04:09:54,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:09:54,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:09:54,698 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-06 04:09:54,739 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-06 04:09:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:09:54,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:09:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:09:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:09:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:09:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:09:54,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:09:54,755 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:09:54,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:09:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:09:54,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:09:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:09:54,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:09:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:09:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:09:54,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:09:54,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:09:54,758 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:09:54,939 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:09:54,946 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:09:55,216 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:09:55,389 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:09:55,390 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:09:55,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:55 BoogieIcfgContainer [2022-12-06 04:09:55,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:09:55,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:09:55,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:09:55,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:09:55,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:09:54" (1/3) ... [2022-12-06 04:09:55,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230b7cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:55, skipping insertion in model container [2022-12-06 04:09:55,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:09:54" (2/3) ... [2022-12-06 04:09:55,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230b7cd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:09:55, skipping insertion in model container [2022-12-06 04:09:55,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:09:55" (3/3) ... [2022-12-06 04:09:55,401 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-12-06 04:09:55,414 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:09:55,415 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:09:55,415 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:09:55,468 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:09:55,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:09:55,613 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:09:55,614 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:55,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:09:55,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 04:09:55,621 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 04:09:55,622 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:09:55,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:09:55,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 04:09:55,657 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 04:09:55,657 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:09:55,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 04:09:55,661 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 04:09:55,661 INFO L188 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-06 04:10:00,604 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 04:10:00,639 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:10:00,647 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;@54b98f48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:10:00,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:10:00,659 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:10:00,659 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:00,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:00,660 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:00,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:00,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:00,664 INFO L85 PathProgramCache]: Analyzing trace with hash -375403712, now seen corresponding path program 1 times [2022-12-06 04:10:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:00,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976730126] [2022-12-06 04:10:00,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:00,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:00,999 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-06 04:10:01,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:01,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976730126] [2022-12-06 04:10:01,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976730126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:01,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:01,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:01,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903958882] [2022-12-06 04:10:01,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:01,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:01,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:01,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:01,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:01,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-06 04:10:01,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 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-06 04:10:01,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:01,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-06 04:10:01,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:01,577 INFO L130 PetriNetUnfolder]: 3519/5103 cut-off events. [2022-12-06 04:10:01,577 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 04:10:01,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10083 conditions, 5103 events. 3519/5103 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 27245 event pairs, 954 based on Foata normal form. 0/4619 useless extension candidates. Maximal degree in co-relation 10071. Up to 3826 conditions per place. [2022-12-06 04:10:01,601 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 33 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2022-12-06 04:10:01,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2022-12-06 04:10:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:01,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 04:10:01,608 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2022-12-06 04:10:01,609 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 61 transitions. [2022-12-06 04:10:01,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2022-12-06 04:10:01,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:10:01,613 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2022-12-06 04:10:01,615 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-06 04:10:01,617 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2022-12-06 04:10:01,617 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:01,618 INFO L89 Accepts]: Start accepts. Operand has 41 places, 27 transitions, 66 flow [2022-12-06 04:10:01,619 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:01,619 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:01,620 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 27 transitions, 66 flow [2022-12-06 04:10:01,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 04:10:01,624 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 04:10:01,624 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:01,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:10:01,625 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 04:10:01,625 INFO L188 LiptonReduction]: Number of co-enabled transitions 370 [2022-12-06 04:10:01,682 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:01,684 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 04:10:01,684 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 04:10:01,684 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-06 04:10:01,684 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:01,684 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:10:01,684 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:01,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash 879830714, now seen corresponding path program 1 times [2022-12-06 04:10:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:01,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136246227] [2022-12-06 04:10:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:01,829 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-06 04:10:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:01,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136246227] [2022-12-06 04:10:01,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136246227] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:01,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:01,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:01,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703731859] [2022-12-06 04:10:01,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:01,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:01,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:01,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:01,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:01,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:10:01,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) 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-06 04:10:01,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:01,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:10:01,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:02,249 INFO L130 PetriNetUnfolder]: 3047/4384 cut-off events. [2022-12-06 04:10:02,250 INFO L131 PetriNetUnfolder]: For 278/278 co-relation queries the response was YES. [2022-12-06 04:10:02,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9046 conditions, 4384 events. 3047/4384 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22276 event pairs, 959 based on Foata normal form. 32/4367 useless extension candidates. Maximal degree in co-relation 9036. Up to 3903 conditions per place. [2022-12-06 04:10:02,272 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 37 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-06 04:10:02,272 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 188 flow [2022-12-06 04:10:02,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 04:10:02,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2022-12-06 04:10:02,274 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 53 transitions. [2022-12-06 04:10:02,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 188 flow [2022-12-06 04:10:02,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:02,275 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2022-12-06 04:10:02,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-06 04:10:02,276 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2022-12-06 04:10:02,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:02,276 INFO L89 Accepts]: Start accepts. Operand has 39 places, 29 transitions, 81 flow [2022-12-06 04:10:02,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:02,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:02,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2022-12-06 04:10:02,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2022-12-06 04:10:02,282 INFO L130 PetriNetUnfolder]: 3/39 cut-off events. [2022-12-06 04:10:02,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:02,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 54. Up to 10 conditions per place. [2022-12-06 04:10:02,283 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2022-12-06 04:10:02,283 INFO L188 LiptonReduction]: Number of co-enabled transitions 424 [2022-12-06 04:10:02,293 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:02,294 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 04:10:02,295 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 81 flow [2022-12-06 04:10:02,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) 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-06 04:10:02,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:02,295 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:02,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:10:02,296 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:02,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1504948492, now seen corresponding path program 1 times [2022-12-06 04:10:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:02,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771463343] [2022-12-06 04:10:02,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:02,713 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-06 04:10:02,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:02,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771463343] [2022-12-06 04:10:02,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771463343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:02,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:02,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:02,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046287682] [2022-12-06 04:10:02,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:02,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:02,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:02,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:02,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:02,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:10:02,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 81 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:10:02,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:02,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:10:02,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:03,600 INFO L130 PetriNetUnfolder]: 8565/11734 cut-off events. [2022-12-06 04:10:03,601 INFO L131 PetriNetUnfolder]: For 1469/1469 co-relation queries the response was YES. [2022-12-06 04:10:03,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25551 conditions, 11734 events. 8565/11734 cut-off events. For 1469/1469 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 55403 event pairs, 2151 based on Foata normal form. 380/12114 useless extension candidates. Maximal degree in co-relation 25540. Up to 7215 conditions per place. [2022-12-06 04:10:03,653 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 46 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2022-12-06 04:10:03,653 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 267 flow [2022-12-06 04:10:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:03,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 04:10:03,656 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2022-12-06 04:10:03,656 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 81 flow. Second operand 4 states and 56 transitions. [2022-12-06 04:10:03,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 267 flow [2022-12-06 04:10:03,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:03,659 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 176 flow [2022-12-06 04:10:03,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-06 04:10:03,660 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2022-12-06 04:10:03,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:03,660 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 176 flow [2022-12-06 04:10:03,662 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:03,662 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:03,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 176 flow [2022-12-06 04:10:03,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 176 flow [2022-12-06 04:10:03,758 INFO L130 PetriNetUnfolder]: 590/1060 cut-off events. [2022-12-06 04:10:03,758 INFO L131 PetriNetUnfolder]: For 467/546 co-relation queries the response was YES. [2022-12-06 04:10:03,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 1060 events. 590/1060 cut-off events. For 467/546 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6194 event pairs, 310 based on Foata normal form. 16/1038 useless extension candidates. Maximal degree in co-relation 2587. Up to 784 conditions per place. [2022-12-06 04:10:03,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 39 transitions, 176 flow [2022-12-06 04:10:03,770 INFO L188 LiptonReduction]: Number of co-enabled transitions 438 [2022-12-06 04:10:03,789 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:03,790 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 130 [2022-12-06 04:10:03,790 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 176 flow [2022-12-06 04:10:03,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 04:10:03,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:03,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:03,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:10:03,791 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:03,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 22104845, now seen corresponding path program 1 times [2022-12-06 04:10:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:03,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572790558] [2022-12-06 04:10:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:04,040 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-06 04:10:04,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:04,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572790558] [2022-12-06 04:10:04,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572790558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:04,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:04,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:04,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990428541] [2022-12-06 04:10:04,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:04,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:04,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:04,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:10:04,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-06 04:10:04,045 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:04,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:10:04,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:04,757 INFO L130 PetriNetUnfolder]: 6371/9214 cut-off events. [2022-12-06 04:10:04,757 INFO L131 PetriNetUnfolder]: For 6178/6291 co-relation queries the response was YES. [2022-12-06 04:10:04,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25460 conditions, 9214 events. 6371/9214 cut-off events. For 6178/6291 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51332 event pairs, 1566 based on Foata normal form. 62/9004 useless extension candidates. Maximal degree in co-relation 25445. Up to 7525 conditions per place. [2022-12-06 04:10:04,810 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 45 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2022-12-06 04:10:04,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 346 flow [2022-12-06 04:10:04,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-06 04:10:04,812 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 04:10:04,812 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 176 flow. Second operand 3 states and 50 transitions. [2022-12-06 04:10:04,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 346 flow [2022-12-06 04:10:04,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 340 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:04,822 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 204 flow [2022-12-06 04:10:04,822 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-06 04:10:04,823 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2022-12-06 04:10:04,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:04,823 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 204 flow [2022-12-06 04:10:04,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:04,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:04,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 204 flow [2022-12-06 04:10:04,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 204 flow [2022-12-06 04:10:04,934 INFO L130 PetriNetUnfolder]: 736/1349 cut-off events. [2022-12-06 04:10:04,935 INFO L131 PetriNetUnfolder]: For 909/1059 co-relation queries the response was YES. [2022-12-06 04:10:04,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3451 conditions, 1349 events. 736/1349 cut-off events. For 909/1059 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 8324 event pairs, 379 based on Foata normal form. 16/1321 useless extension candidates. Maximal degree in co-relation 3437. Up to 961 conditions per place. [2022-12-06 04:10:04,943 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 204 flow [2022-12-06 04:10:04,944 INFO L188 LiptonReduction]: Number of co-enabled transitions 488 [2022-12-06 04:10:04,951 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:04,956 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 133 [2022-12-06 04:10:04,956 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 204 flow [2022-12-06 04:10:04,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-06 04:10:04,956 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:04,957 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:04,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:10:04,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:04,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1164196466, now seen corresponding path program 1 times [2022-12-06 04:10:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:04,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140937093] [2022-12-06 04:10:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:05,300 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-06 04:10:05,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:05,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140937093] [2022-12-06 04:10:05,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140937093] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:05,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:05,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:05,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437626181] [2022-12-06 04:10:05,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:05,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:05,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:05,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:05,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:05,302 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:10:05,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 204 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-06 04:10:05,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:05,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:10:05,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:06,482 INFO L130 PetriNetUnfolder]: 10649/14718 cut-off events. [2022-12-06 04:10:06,482 INFO L131 PetriNetUnfolder]: For 11551/11551 co-relation queries the response was YES. [2022-12-06 04:10:06,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43231 conditions, 14718 events. 10649/14718 cut-off events. For 11551/11551 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 74990 event pairs, 3339 based on Foata normal form. 184/14902 useless extension candidates. Maximal degree in co-relation 43214. Up to 7881 conditions per place. [2022-12-06 04:10:06,546 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 64 selfloop transitions, 11 changer transitions 2/77 dead transitions. [2022-12-06 04:10:06,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 483 flow [2022-12-06 04:10:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:06,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 04:10:06,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2022-12-06 04:10:06,548 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 204 flow. Second operand 4 states and 62 transitions. [2022-12-06 04:10:06,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 483 flow [2022-12-06 04:10:06,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:06,554 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 263 flow [2022-12-06 04:10:06,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-06 04:10:06,555 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2022-12-06 04:10:06,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:06,555 INFO L89 Accepts]: Start accepts. Operand has 50 places, 46 transitions, 263 flow [2022-12-06 04:10:06,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:06,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:06,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 46 transitions, 263 flow [2022-12-06 04:10:06,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 263 flow [2022-12-06 04:10:06,705 INFO L130 PetriNetUnfolder]: 939/1757 cut-off events. [2022-12-06 04:10:06,706 INFO L131 PetriNetUnfolder]: For 2456/2518 co-relation queries the response was YES. [2022-12-06 04:10:06,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4790 conditions, 1757 events. 939/1757 cut-off events. For 2456/2518 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 11767 event pairs, 497 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 4773. Up to 1262 conditions per place. [2022-12-06 04:10:06,726 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 263 flow [2022-12-06 04:10:06,726 INFO L188 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-06 04:10:06,737 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:06,738 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 183 [2022-12-06 04:10:06,738 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 263 flow [2022-12-06 04:10:06,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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-06 04:10:06,738 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:06,738 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:06,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:10:06,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:06,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1961387065, now seen corresponding path program 1 times [2022-12-06 04:10:06,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:06,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247497955] [2022-12-06 04:10:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:07,097 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-06 04:10:07,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:07,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247497955] [2022-12-06 04:10:07,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247497955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:07,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:07,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:07,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675411737] [2022-12-06 04:10:07,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:07,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:07,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:07,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:07,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:10:07,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:07,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:07,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:10:07,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:07,946 INFO L130 PetriNetUnfolder]: 7548/10978 cut-off events. [2022-12-06 04:10:07,947 INFO L131 PetriNetUnfolder]: For 15212/15358 co-relation queries the response was YES. [2022-12-06 04:10:07,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33584 conditions, 10978 events. 7548/10978 cut-off events. For 15212/15358 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 63766 event pairs, 1129 based on Foata normal form. 198/10681 useless extension candidates. Maximal degree in co-relation 33564. Up to 8085 conditions per place. [2022-12-06 04:10:07,995 INFO L137 encePairwiseOnDemand]: 23/27 looper letters, 58 selfloop transitions, 7 changer transitions 1/76 dead transitions. [2022-12-06 04:10:07,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 513 flow [2022-12-06 04:10:07,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:07,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 04:10:07,996 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2022-12-06 04:10:07,996 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 263 flow. Second operand 4 states and 65 transitions. [2022-12-06 04:10:07,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 513 flow [2022-12-06 04:10:08,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 503 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-06 04:10:08,002 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 274 flow [2022-12-06 04:10:08,002 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-06 04:10:08,002 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2022-12-06 04:10:08,003 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:08,003 INFO L89 Accepts]: Start accepts. Operand has 54 places, 46 transitions, 274 flow [2022-12-06 04:10:08,003 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:08,003 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:08,004 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 46 transitions, 274 flow [2022-12-06 04:10:08,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 46 transitions, 274 flow [2022-12-06 04:10:08,114 INFO L130 PetriNetUnfolder]: 895/1686 cut-off events. [2022-12-06 04:10:08,115 INFO L131 PetriNetUnfolder]: For 2766/2825 co-relation queries the response was YES. [2022-12-06 04:10:08,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4758 conditions, 1686 events. 895/1686 cut-off events. For 2766/2825 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 11349 event pairs, 535 based on Foata normal form. 5/1609 useless extension candidates. Maximal degree in co-relation 4738. Up to 1210 conditions per place. [2022-12-06 04:10:08,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 46 transitions, 274 flow [2022-12-06 04:10:08,129 INFO L188 LiptonReduction]: Number of co-enabled transitions 482 [2022-12-06 04:10:08,141 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:08,142 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 139 [2022-12-06 04:10:08,142 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 274 flow [2022-12-06 04:10:08,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:08,142 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:08,142 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:08,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:10:08,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash -318395554, now seen corresponding path program 1 times [2022-12-06 04:10:08,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:08,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449028263] [2022-12-06 04:10:08,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:08,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:08,453 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-06 04:10:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:08,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449028263] [2022-12-06 04:10:08,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449028263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:08,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:08,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691484325] [2022-12-06 04:10:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:08,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:08,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:08,456 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 04:10:08,456 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:08,456 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:08,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 04:10:08,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:09,498 INFO L130 PetriNetUnfolder]: 8583/12287 cut-off events. [2022-12-06 04:10:09,499 INFO L131 PetriNetUnfolder]: For 20148/20384 co-relation queries the response was YES. [2022-12-06 04:10:09,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38593 conditions, 12287 events. 8583/12287 cut-off events. For 20148/20384 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 69439 event pairs, 1675 based on Foata normal form. 201/11902 useless extension candidates. Maximal degree in co-relation 38570. Up to 8836 conditions per place. [2022-12-06 04:10:09,576 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 80 selfloop transitions, 38 changer transitions 8/136 dead transitions. [2022-12-06 04:10:09,576 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 136 transitions, 937 flow [2022-12-06 04:10:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:10:09,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:10:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-06 04:10:09,577 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2022-12-06 04:10:09,578 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 274 flow. Second operand 8 states and 121 transitions. [2022-12-06 04:10:09,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 136 transitions, 937 flow [2022-12-06 04:10:09,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 136 transitions, 899 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:09,590 INFO L231 Difference]: Finished difference. Result has 64 places, 79 transitions, 595 flow [2022-12-06 04:10:09,590 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=595, PETRI_PLACES=64, PETRI_TRANSITIONS=79} [2022-12-06 04:10:09,590 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2022-12-06 04:10:09,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:09,591 INFO L89 Accepts]: Start accepts. Operand has 64 places, 79 transitions, 595 flow [2022-12-06 04:10:09,592 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:09,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:09,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 79 transitions, 595 flow [2022-12-06 04:10:09,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 79 transitions, 595 flow [2022-12-06 04:10:09,803 INFO L130 PetriNetUnfolder]: 1051/1957 cut-off events. [2022-12-06 04:10:09,803 INFO L131 PetriNetUnfolder]: For 6193/6498 co-relation queries the response was YES. [2022-12-06 04:10:09,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 1957 events. 1051/1957 cut-off events. For 6193/6498 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 13228 event pairs, 357 based on Foata normal form. 25/1883 useless extension candidates. Maximal degree in co-relation 7112. Up to 1427 conditions per place. [2022-12-06 04:10:09,822 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 79 transitions, 595 flow [2022-12-06 04:10:09,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-06 04:10:10,034 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:10:10,106 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:10,199 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [480] L3-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_136 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_140 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_257 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse4 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_231 256) 0)))) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_258 256) 0))))) (and (= v_~y$r_buff1_thd0~0_135 (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd0~0_139 256))) .cse0) (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse1)) 0 v_~y$r_buff1_thd0~0_136)) (= v_~y$r_buff0_thd0~0_139 (ite .cse2 0 v_~y$r_buff0_thd0~0_140)) (= v_~y~0_187 (ite .cse3 v_~y$w_buff0~0_149 (ite .cse4 v_~y$w_buff1~0_152 v_~y~0_188))) (= v_~y$w_buff1_used~0_230 (ite (or .cse2 .cse4) 0 v_~y$w_buff1_used~0_231)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= (ite .cse3 0 v_~y$w_buff0_used~0_258) v_~y$w_buff0_used~0_257)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_188, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_231} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_257, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:10,265 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [480] L3-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_136 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_140 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_257 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse4 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_231 256) 0)))) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_258 256) 0))))) (and (= v_~y$r_buff1_thd0~0_135 (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd0~0_139 256))) .cse0) (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse1)) 0 v_~y$r_buff1_thd0~0_136)) (= v_~y$r_buff0_thd0~0_139 (ite .cse2 0 v_~y$r_buff0_thd0~0_140)) (= v_~y~0_187 (ite .cse3 v_~y$w_buff0~0_149 (ite .cse4 v_~y$w_buff1~0_152 v_~y~0_188))) (= v_~y$w_buff1_used~0_230 (ite (or .cse2 .cse4) 0 v_~y$w_buff1_used~0_231)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= (ite .cse3 0 v_~y$w_buff0_used~0_258) v_~y$w_buff0_used~0_257)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_188, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_231} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_257, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:10,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:10,641 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [480] L3-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_136 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_140 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_257 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse4 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_231 256) 0)))) (.cse3 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_258 256) 0))))) (and (= v_~y$r_buff1_thd0~0_135 (ite (or (and (not (= 0 (mod v_~y$r_buff0_thd0~0_139 256))) .cse0) (and (not (= 0 (mod v_~y$w_buff1_used~0_230 256))) .cse1)) 0 v_~y$r_buff1_thd0~0_136)) (= v_~y$r_buff0_thd0~0_139 (ite .cse2 0 v_~y$r_buff0_thd0~0_140)) (= v_~y~0_187 (ite .cse3 v_~y$w_buff0~0_149 (ite .cse4 v_~y$w_buff1~0_152 v_~y~0_188))) (= v_~y$w_buff1_used~0_230 (ite (or .cse2 .cse4) 0 v_~y$w_buff1_used~0_231)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_9| 0)) (= (ite .cse3 0 v_~y$w_buff0_used~0_258) v_~y$w_buff0_used~0_257)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_258, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_140, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_188, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_231} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_257, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_149, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_9|, ~y~0=v_~y~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_230} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:10,745 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:11,259 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:10:11,260 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1670 [2022-12-06 04:10:11,260 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 74 transitions, 595 flow [2022-12-06 04:10:11,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:11,261 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:11,261 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:11,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:10:11,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash -233079896, now seen corresponding path program 1 times [2022-12-06 04:10:11,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:11,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823393966] [2022-12-06 04:10:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:11,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:11,452 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-06 04:10:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:11,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823393966] [2022-12-06 04:10:11,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823393966] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:11,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:11,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440622199] [2022-12-06 04:10:11,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:11,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:11,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:11,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:11,453 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:10:11,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 74 transitions, 595 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-06 04:10:11,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:11,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:10:11,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:12,293 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][52], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), 36#L806true, P1Thread1of1ForFork1InUse, 153#true, P3Thread1of1ForFork0InUse, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, 78#L853-3true, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), 176#true, Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-06 04:10:12,293 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2022-12-06 04:10:12,293 INFO L385 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2022-12-06 04:10:12,293 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 04:10:12,293 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 04:10:12,492 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][52], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), 36#L806true, 71#L3true, P1Thread1of1ForFork1InUse, 153#true, P3Thread1of1ForFork0InUse, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), 176#true, Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-06 04:10:12,492 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 04:10:12,492 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 04:10:12,492 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:12,492 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:12,496 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][52], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), P1Thread1of1ForFork1InUse, 153#true, 52#P2EXITtrue, P3Thread1of1ForFork0InUse, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, 78#L853-3true, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), 176#true, Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-06 04:10:12,496 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-06 04:10:12,497 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:12,497 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:12,497 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-06 04:10:12,668 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][52], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 114#L864true, 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), 36#L806true, P1Thread1of1ForFork1InUse, 153#true, P3Thread1of1ForFork0InUse, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), 176#true, Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-06 04:10:12,668 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 04:10:12,668 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:12,668 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:12,668 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:12,671 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][52], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), 71#L3true, P1Thread1of1ForFork1InUse, 153#true, P3Thread1of1ForFork0InUse, 52#P2EXITtrue, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), 176#true, Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-06 04:10:12,671 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 04:10:12,671 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:12,671 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:12,671 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:12,914 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][52], [111#L776true, 114#L864true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), P1Thread1of1ForFork1InUse, 153#true, 52#P2EXITtrue, P3Thread1of1ForFork0InUse, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), 45#L822true, 176#true, Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-06 04:10:12,915 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 04:10:12,915 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 04:10:12,915 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-06 04:10:12,915 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:13,042 INFO L130 PetriNetUnfolder]: 13007/18595 cut-off events. [2022-12-06 04:10:13,042 INFO L131 PetriNetUnfolder]: For 64973/65081 co-relation queries the response was YES. [2022-12-06 04:10:13,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70126 conditions, 18595 events. 13007/18595 cut-off events. For 64973/65081 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 109909 event pairs, 1616 based on Foata normal form. 247/18582 useless extension candidates. Maximal degree in co-relation 70098. Up to 9801 conditions per place. [2022-12-06 04:10:13,163 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 103 selfloop transitions, 3 changer transitions 16/129 dead transitions. [2022-12-06 04:10:13,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 129 transitions, 1231 flow [2022-12-06 04:10:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:13,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 04:10:13,165 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2022-12-06 04:10:13,165 INFO L175 Difference]: Start difference. First operand has 62 places, 74 transitions, 595 flow. Second operand 4 states and 71 transitions. [2022-12-06 04:10:13,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 129 transitions, 1231 flow [2022-12-06 04:10:13,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 129 transitions, 1177 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:13,589 INFO L231 Difference]: Finished difference. Result has 65 places, 75 transitions, 582 flow [2022-12-06 04:10:13,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=582, PETRI_PLACES=65, PETRI_TRANSITIONS=75} [2022-12-06 04:10:13,589 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places. [2022-12-06 04:10:13,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:13,590 INFO L89 Accepts]: Start accepts. Operand has 65 places, 75 transitions, 582 flow [2022-12-06 04:10:13,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:13,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:13,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 75 transitions, 582 flow [2022-12-06 04:10:13,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 75 transitions, 582 flow [2022-12-06 04:10:13,791 INFO L130 PetriNetUnfolder]: 1430/2822 cut-off events. [2022-12-06 04:10:13,792 INFO L131 PetriNetUnfolder]: For 7070/7328 co-relation queries the response was YES. [2022-12-06 04:10:13,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9759 conditions, 2822 events. 1430/2822 cut-off events. For 7070/7328 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 21663 event pairs, 548 based on Foata normal form. 5/2724 useless extension candidates. Maximal degree in co-relation 9733. Up to 1998 conditions per place. [2022-12-06 04:10:13,816 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 75 transitions, 582 flow [2022-12-06 04:10:13,816 INFO L188 LiptonReduction]: Number of co-enabled transitions 672 [2022-12-06 04:10:13,871 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:13,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 283 [2022-12-06 04:10:13,872 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 75 transitions, 585 flow [2022-12-06 04:10:13,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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-06 04:10:13,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:13,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:13,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:10:13,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1268455498, now seen corresponding path program 2 times [2022-12-06 04:10:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:13,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638126264] [2022-12-06 04:10:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:14,197 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-06 04:10:14,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:14,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638126264] [2022-12-06 04:10:14,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638126264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:14,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:14,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:14,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548736696] [2022-12-06 04:10:14,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:14,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:14,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:14,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:14,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:14,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:10:14,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 75 transitions, 585 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:14,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:14,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:10:14,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:16,307 INFO L130 PetriNetUnfolder]: 15167/21927 cut-off events. [2022-12-06 04:10:16,307 INFO L131 PetriNetUnfolder]: For 57827/58406 co-relation queries the response was YES. [2022-12-06 04:10:16,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79203 conditions, 21927 events. 15167/21927 cut-off events. For 57827/58406 co-relation queries the response was YES. Maximal size of possible extension queue 1187. Compared 140597 event pairs, 1723 based on Foata normal form. 275/21321 useless extension candidates. Maximal degree in co-relation 79174. Up to 14606 conditions per place. [2022-12-06 04:10:16,458 INFO L137 encePairwiseOnDemand]: 22/36 looper letters, 85 selfloop transitions, 45 changer transitions 8/148 dead transitions. [2022-12-06 04:10:16,459 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 148 transitions, 1260 flow [2022-12-06 04:10:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:10:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:10:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2022-12-06 04:10:16,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-06 04:10:16,460 INFO L175 Difference]: Start difference. First operand has 65 places, 75 transitions, 585 flow. Second operand 7 states and 120 transitions. [2022-12-06 04:10:16,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 148 transitions, 1260 flow [2022-12-06 04:10:16,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 148 transitions, 1253 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:16,509 INFO L231 Difference]: Finished difference. Result has 73 places, 89 transitions, 828 flow [2022-12-06 04:10:16,510 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=828, PETRI_PLACES=73, PETRI_TRANSITIONS=89} [2022-12-06 04:10:16,510 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2022-12-06 04:10:16,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:16,510 INFO L89 Accepts]: Start accepts. Operand has 73 places, 89 transitions, 828 flow [2022-12-06 04:10:16,511 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:16,511 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:16,511 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 89 transitions, 828 flow [2022-12-06 04:10:16,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 89 transitions, 828 flow [2022-12-06 04:10:16,853 INFO L130 PetriNetUnfolder]: 1884/3560 cut-off events. [2022-12-06 04:10:16,853 INFO L131 PetriNetUnfolder]: For 13668/14046 co-relation queries the response was YES. [2022-12-06 04:10:16,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15213 conditions, 3560 events. 1884/3560 cut-off events. For 13668/14046 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 27372 event pairs, 539 based on Foata normal form. 63/3516 useless extension candidates. Maximal degree in co-relation 15183. Up to 2554 conditions per place. [2022-12-06 04:10:16,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 89 transitions, 828 flow [2022-12-06 04:10:16,893 INFO L188 LiptonReduction]: Number of co-enabled transitions 836 [2022-12-06 04:10:16,925 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:16,926 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 416 [2022-12-06 04:10:16,926 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 89 transitions, 828 flow [2022-12-06 04:10:16,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:16,926 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:16,927 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:16,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:10:16,927 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:16,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1113812304, now seen corresponding path program 1 times [2022-12-06 04:10:16,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:16,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360246947] [2022-12-06 04:10:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:17,208 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-06 04:10:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:17,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360246947] [2022-12-06 04:10:17,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360246947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:17,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:17,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122170241] [2022-12-06 04:10:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:17,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:17,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:17,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:17,211 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:10:17,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 89 transitions, 828 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:17,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:17,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:10:17,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:19,097 INFO L130 PetriNetUnfolder]: 15153/21986 cut-off events. [2022-12-06 04:10:19,097 INFO L131 PetriNetUnfolder]: For 92112/93294 co-relation queries the response was YES. [2022-12-06 04:10:19,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93639 conditions, 21986 events. 15153/21986 cut-off events. For 92112/93294 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 141417 event pairs, 3334 based on Foata normal form. 684/21732 useless extension candidates. Maximal degree in co-relation 93606. Up to 18549 conditions per place. [2022-12-06 04:10:19,250 INFO L137 encePairwiseOnDemand]: 23/36 looper letters, 91 selfloop transitions, 19 changer transitions 0/120 dead transitions. [2022-12-06 04:10:19,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 120 transitions, 1242 flow [2022-12-06 04:10:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 04:10:19,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:10:19,251 INFO L175 Difference]: Start difference. First operand has 73 places, 89 transitions, 828 flow. Second operand 4 states and 72 transitions. [2022-12-06 04:10:19,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 120 transitions, 1242 flow [2022-12-06 04:10:19,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 120 transitions, 1160 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:19,387 INFO L231 Difference]: Finished difference. Result has 75 places, 98 transitions, 918 flow [2022-12-06 04:10:19,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=918, PETRI_PLACES=75, PETRI_TRANSITIONS=98} [2022-12-06 04:10:19,388 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2022-12-06 04:10:19,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:19,388 INFO L89 Accepts]: Start accepts. Operand has 75 places, 98 transitions, 918 flow [2022-12-06 04:10:19,389 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:19,389 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:19,390 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 98 transitions, 918 flow [2022-12-06 04:10:19,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 98 transitions, 918 flow [2022-12-06 04:10:19,711 INFO L130 PetriNetUnfolder]: 1970/3705 cut-off events. [2022-12-06 04:10:19,711 INFO L131 PetriNetUnfolder]: For 15078/15632 co-relation queries the response was YES. [2022-12-06 04:10:19,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16077 conditions, 3705 events. 1970/3705 cut-off events. For 15078/15632 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 28522 event pairs, 519 based on Foata normal form. 127/3733 useless extension candidates. Maximal degree in co-relation 16045. Up to 2662 conditions per place. [2022-12-06 04:10:19,893 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 98 transitions, 918 flow [2022-12-06 04:10:19,894 INFO L188 LiptonReduction]: Number of co-enabled transitions 908 [2022-12-06 04:10:19,933 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:19,934 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 546 [2022-12-06 04:10:19,934 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 98 transitions, 918 flow [2022-12-06 04:10:19,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:19,935 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:19,935 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:19,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:10:19,935 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:19,935 INFO L85 PathProgramCache]: Analyzing trace with hash -504332154, now seen corresponding path program 2 times [2022-12-06 04:10:19,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:19,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676793840] [2022-12-06 04:10:19,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:19,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:20,206 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-06 04:10:20,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:20,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676793840] [2022-12-06 04:10:20,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676793840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:20,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:20,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245899050] [2022-12-06 04:10:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:20,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:20,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:20,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:20,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:20,208 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:10:20,208 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 98 transitions, 918 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:20,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:20,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:10:20,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:22,104 INFO L130 PetriNetUnfolder]: 14978/21730 cut-off events. [2022-12-06 04:10:22,104 INFO L131 PetriNetUnfolder]: For 86545/87801 co-relation queries the response was YES. [2022-12-06 04:10:22,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91835 conditions, 21730 events. 14978/21730 cut-off events. For 86545/87801 co-relation queries the response was YES. Maximal size of possible extension queue 1131. Compared 138129 event pairs, 4078 based on Foata normal form. 769/21703 useless extension candidates. Maximal degree in co-relation 91800. Up to 18069 conditions per place. [2022-12-06 04:10:22,225 INFO L137 encePairwiseOnDemand]: 23/36 looper letters, 96 selfloop transitions, 34 changer transitions 5/145 dead transitions. [2022-12-06 04:10:22,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 145 transitions, 1566 flow [2022-12-06 04:10:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-06 04:10:22,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2022-12-06 04:10:22,226 INFO L175 Difference]: Start difference. First operand has 75 places, 98 transitions, 918 flow. Second operand 5 states and 89 transitions. [2022-12-06 04:10:22,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 145 transitions, 1566 flow [2022-12-06 04:10:22,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 145 transitions, 1516 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:22,405 INFO L231 Difference]: Finished difference. Result has 81 places, 114 transitions, 1210 flow [2022-12-06 04:10:22,405 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1210, PETRI_PLACES=81, PETRI_TRANSITIONS=114} [2022-12-06 04:10:22,406 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 36 predicate places. [2022-12-06 04:10:22,406 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:22,406 INFO L89 Accepts]: Start accepts. Operand has 81 places, 114 transitions, 1210 flow [2022-12-06 04:10:22,409 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:22,409 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:22,409 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 114 transitions, 1210 flow [2022-12-06 04:10:22,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 114 transitions, 1210 flow [2022-12-06 04:10:22,702 INFO L130 PetriNetUnfolder]: 1869/3572 cut-off events. [2022-12-06 04:10:22,702 INFO L131 PetriNetUnfolder]: For 17835/18514 co-relation queries the response was YES. [2022-12-06 04:10:22,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16114 conditions, 3572 events. 1869/3572 cut-off events. For 17835/18514 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 27797 event pairs, 342 based on Foata normal form. 128/3594 useless extension candidates. Maximal degree in co-relation 16078. Up to 2539 conditions per place. [2022-12-06 04:10:22,754 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 114 transitions, 1210 flow [2022-12-06 04:10:22,754 INFO L188 LiptonReduction]: Number of co-enabled transitions 1014 [2022-12-06 04:10:22,794 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:22,794 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 388 [2022-12-06 04:10:22,794 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 114 transitions, 1210 flow [2022-12-06 04:10:22,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:22,795 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:22,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:22,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:10:22,795 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:22,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash -504733883, now seen corresponding path program 1 times [2022-12-06 04:10:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:22,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714000555] [2022-12-06 04:10:22,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:22,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:23,027 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-06 04:10:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:23,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714000555] [2022-12-06 04:10:23,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714000555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:23,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:23,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451261364] [2022-12-06 04:10:23,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:23,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:23,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:23,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:23,028 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:10:23,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 114 transitions, 1210 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:23,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:23,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:10:23,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:25,428 INFO L130 PetriNetUnfolder]: 14656/21341 cut-off events. [2022-12-06 04:10:25,429 INFO L131 PetriNetUnfolder]: For 107712/109218 co-relation queries the response was YES. [2022-12-06 04:10:25,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94222 conditions, 21341 events. 14656/21341 cut-off events. For 107712/109218 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 136604 event pairs, 2863 based on Foata normal form. 375/20840 useless extension candidates. Maximal degree in co-relation 94183. Up to 16965 conditions per place. [2022-12-06 04:10:25,660 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 103 selfloop transitions, 27 changer transitions 3/143 dead transitions. [2022-12-06 04:10:25,660 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 143 transitions, 1640 flow [2022-12-06 04:10:25,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-06 04:10:25,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2022-12-06 04:10:25,662 INFO L175 Difference]: Start difference. First operand has 81 places, 114 transitions, 1210 flow. Second operand 5 states and 82 transitions. [2022-12-06 04:10:25,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 143 transitions, 1640 flow [2022-12-06 04:10:25,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 143 transitions, 1588 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:25,954 INFO L231 Difference]: Finished difference. Result has 85 places, 117 transitions, 1269 flow [2022-12-06 04:10:25,954 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1269, PETRI_PLACES=85, PETRI_TRANSITIONS=117} [2022-12-06 04:10:25,954 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2022-12-06 04:10:25,954 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:25,955 INFO L89 Accepts]: Start accepts. Operand has 85 places, 117 transitions, 1269 flow [2022-12-06 04:10:25,955 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:25,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:25,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 117 transitions, 1269 flow [2022-12-06 04:10:25,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 117 transitions, 1269 flow [2022-12-06 04:10:26,375 INFO L130 PetriNetUnfolder]: 1782/3360 cut-off events. [2022-12-06 04:10:26,375 INFO L131 PetriNetUnfolder]: For 18594/19206 co-relation queries the response was YES. [2022-12-06 04:10:26,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15783 conditions, 3360 events. 1782/3360 cut-off events. For 18594/19206 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 25235 event pairs, 409 based on Foata normal form. 125/3384 useless extension candidates. Maximal degree in co-relation 15745. Up to 2421 conditions per place. [2022-12-06 04:10:26,413 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 117 transitions, 1269 flow [2022-12-06 04:10:26,413 INFO L188 LiptonReduction]: Number of co-enabled transitions 1030 [2022-12-06 04:10:26,441 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:26,441 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 487 [2022-12-06 04:10:26,441 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 117 transitions, 1269 flow [2022-12-06 04:10:26,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:26,442 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:26,442 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:26,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:10:26,442 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:26,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:26,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1533001207, now seen corresponding path program 1 times [2022-12-06 04:10:26,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:26,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742802517] [2022-12-06 04:10:26,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:26,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:26,794 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-06 04:10:26,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:26,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742802517] [2022-12-06 04:10:26,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742802517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:26,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:26,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:26,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674960609] [2022-12-06 04:10:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:26,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:26,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:26,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:26,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 04:10:26,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 117 transitions, 1269 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:26,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:26,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 04:10:26,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:28,853 INFO L130 PetriNetUnfolder]: 14503/21103 cut-off events. [2022-12-06 04:10:28,853 INFO L131 PetriNetUnfolder]: For 120257/121798 co-relation queries the response was YES. [2022-12-06 04:10:29,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93817 conditions, 21103 events. 14503/21103 cut-off events. For 120257/121798 co-relation queries the response was YES. Maximal size of possible extension queue 1136. Compared 134103 event pairs, 2494 based on Foata normal form. 443/20780 useless extension candidates. Maximal degree in co-relation 93776. Up to 13667 conditions per place. [2022-12-06 04:10:29,100 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 78 selfloop transitions, 57 changer transitions 10/155 dead transitions. [2022-12-06 04:10:29,101 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 155 transitions, 1785 flow [2022-12-06 04:10:29,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 04:10:29,102 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2022-12-06 04:10:29,102 INFO L175 Difference]: Start difference. First operand has 85 places, 117 transitions, 1269 flow. Second operand 5 states and 88 transitions. [2022-12-06 04:10:29,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 155 transitions, 1785 flow [2022-12-06 04:10:29,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 155 transitions, 1689 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-06 04:10:29,447 INFO L231 Difference]: Finished difference. Result has 86 places, 112 transitions, 1287 flow [2022-12-06 04:10:29,447 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1287, PETRI_PLACES=86, PETRI_TRANSITIONS=112} [2022-12-06 04:10:29,448 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2022-12-06 04:10:29,448 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:29,448 INFO L89 Accepts]: Start accepts. Operand has 86 places, 112 transitions, 1287 flow [2022-12-06 04:10:29,448 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:29,449 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:29,449 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 112 transitions, 1287 flow [2022-12-06 04:10:29,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 112 transitions, 1287 flow [2022-12-06 04:10:29,711 INFO L130 PetriNetUnfolder]: 1654/3137 cut-off events. [2022-12-06 04:10:29,711 INFO L131 PetriNetUnfolder]: For 18193/18747 co-relation queries the response was YES. [2022-12-06 04:10:29,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15493 conditions, 3137 events. 1654/3137 cut-off events. For 18193/18747 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 23449 event pairs, 383 based on Foata normal form. 82/3122 useless extension candidates. Maximal degree in co-relation 15456. Up to 2244 conditions per place. [2022-12-06 04:10:29,743 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 112 transitions, 1287 flow [2022-12-06 04:10:29,744 INFO L188 LiptonReduction]: Number of co-enabled transitions 990 [2022-12-06 04:10:29,767 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:29,768 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 320 [2022-12-06 04:10:29,768 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 112 transitions, 1287 flow [2022-12-06 04:10:29,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:29,768 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:29,768 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:29,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:10:29,768 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:29,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1533047366, now seen corresponding path program 1 times [2022-12-06 04:10:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:29,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398170877] [2022-12-06 04:10:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:29,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:30,182 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-06 04:10:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:30,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398170877] [2022-12-06 04:10:30,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398170877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:30,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:30,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:30,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605338326] [2022-12-06 04:10:30,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:30,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:30,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:30,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:30,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:30,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 04:10:30,184 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 112 transitions, 1287 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:30,184 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:30,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 04:10:30,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:32,138 INFO L130 PetriNetUnfolder]: 13596/19861 cut-off events. [2022-12-06 04:10:32,138 INFO L131 PetriNetUnfolder]: For 119427/120811 co-relation queries the response was YES. [2022-12-06 04:10:32,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91464 conditions, 19861 events. 13596/19861 cut-off events. For 119427/120811 co-relation queries the response was YES. Maximal size of possible extension queue 1063. Compared 126543 event pairs, 2297 based on Foata normal form. 385/19456 useless extension candidates. Maximal degree in co-relation 91424. Up to 11721 conditions per place. [2022-12-06 04:10:32,308 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 77 selfloop transitions, 44 changer transitions 22/153 dead transitions. [2022-12-06 04:10:32,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 153 transitions, 1797 flow [2022-12-06 04:10:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-06 04:10:32,324 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 04:10:32,324 INFO L175 Difference]: Start difference. First operand has 86 places, 112 transitions, 1287 flow. Second operand 5 states and 90 transitions. [2022-12-06 04:10:32,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 153 transitions, 1797 flow [2022-12-06 04:10:32,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 153 transitions, 1701 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:32,695 INFO L231 Difference]: Finished difference. Result has 88 places, 101 transitions, 1179 flow [2022-12-06 04:10:32,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1179, PETRI_PLACES=88, PETRI_TRANSITIONS=101} [2022-12-06 04:10:32,696 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 43 predicate places. [2022-12-06 04:10:32,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:32,696 INFO L89 Accepts]: Start accepts. Operand has 88 places, 101 transitions, 1179 flow [2022-12-06 04:10:32,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:32,696 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:32,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 101 transitions, 1179 flow [2022-12-06 04:10:32,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 101 transitions, 1179 flow [2022-12-06 04:10:33,125 INFO L130 PetriNetUnfolder]: 1435/2734 cut-off events. [2022-12-06 04:10:33,125 INFO L131 PetriNetUnfolder]: For 16102/16614 co-relation queries the response was YES. [2022-12-06 04:10:33,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13640 conditions, 2734 events. 1435/2734 cut-off events. For 16102/16614 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 19947 event pairs, 365 based on Foata normal form. 66/2715 useless extension candidates. Maximal degree in co-relation 13602. Up to 1935 conditions per place. [2022-12-06 04:10:33,163 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 101 transitions, 1179 flow [2022-12-06 04:10:33,163 INFO L188 LiptonReduction]: Number of co-enabled transitions 888 [2022-12-06 04:10:33,190 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:33,191 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 495 [2022-12-06 04:10:33,191 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 1179 flow [2022-12-06 04:10:33,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:33,191 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:33,191 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:33,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:10:33,191 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:33,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:33,191 INFO L85 PathProgramCache]: Analyzing trace with hash 668033381, now seen corresponding path program 1 times [2022-12-06 04:10:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:33,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384292480] [2022-12-06 04:10:33,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:33,570 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-06 04:10:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:33,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384292480] [2022-12-06 04:10:33,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384292480] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:33,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:33,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:33,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787474474] [2022-12-06 04:10:33,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:33,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:33,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:33,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:33,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:33,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 04:10:33,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 1179 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-06 04:10:33,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:33,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 04:10:33,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:35,210 INFO L130 PetriNetUnfolder]: 11763/17186 cut-off events. [2022-12-06 04:10:35,211 INFO L131 PetriNetUnfolder]: For 101849/102871 co-relation queries the response was YES. [2022-12-06 04:10:35,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79141 conditions, 17186 events. 11763/17186 cut-off events. For 101849/102871 co-relation queries the response was YES. Maximal size of possible extension queue 860. Compared 106330 event pairs, 3417 based on Foata normal form. 744/17367 useless extension candidates. Maximal degree in co-relation 79100. Up to 13286 conditions per place. [2022-12-06 04:10:35,303 INFO L137 encePairwiseOnDemand]: 23/33 looper letters, 92 selfloop transitions, 25 changer transitions 0/127 dead transitions. [2022-12-06 04:10:35,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 127 transitions, 1549 flow [2022-12-06 04:10:35,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2022-12-06 04:10:35,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2022-12-06 04:10:35,305 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 1179 flow. Second operand 4 states and 69 transitions. [2022-12-06 04:10:35,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 127 transitions, 1549 flow [2022-12-06 04:10:35,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 1414 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-12-06 04:10:35,486 INFO L231 Difference]: Finished difference. Result has 83 places, 104 transitions, 1143 flow [2022-12-06 04:10:35,486 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1044, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1143, PETRI_PLACES=83, PETRI_TRANSITIONS=104} [2022-12-06 04:10:35,487 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2022-12-06 04:10:35,487 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:35,487 INFO L89 Accepts]: Start accepts. Operand has 83 places, 104 transitions, 1143 flow [2022-12-06 04:10:35,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:35,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:35,488 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 104 transitions, 1143 flow [2022-12-06 04:10:35,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 104 transitions, 1143 flow [2022-12-06 04:10:35,697 INFO L130 PetriNetUnfolder]: 1427/2705 cut-off events. [2022-12-06 04:10:35,698 INFO L131 PetriNetUnfolder]: For 14398/14910 co-relation queries the response was YES. [2022-12-06 04:10:35,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12849 conditions, 2705 events. 1427/2705 cut-off events. For 14398/14910 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 19624 event pairs, 365 based on Foata normal form. 66/2686 useless extension candidates. Maximal degree in co-relation 12814. Up to 1921 conditions per place. [2022-12-06 04:10:35,723 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 104 transitions, 1143 flow [2022-12-06 04:10:35,724 INFO L188 LiptonReduction]: Number of co-enabled transitions 912 [2022-12-06 04:10:35,747 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:35,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 261 [2022-12-06 04:10:35,748 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 104 transitions, 1143 flow [2022-12-06 04:10:35,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-06 04:10:35,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:35,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:35,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:10:35,749 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:35,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:35,749 INFO L85 PathProgramCache]: Analyzing trace with hash 280188134, now seen corresponding path program 1 times [2022-12-06 04:10:35,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:35,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483158133] [2022-12-06 04:10:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:35,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:35,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:36,050 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-06 04:10:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:36,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483158133] [2022-12-06 04:10:36,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483158133] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:36,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:36,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959856815] [2022-12-06 04:10:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:36,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:36,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:36,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:36,053 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 04:10:36,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 104 transitions, 1143 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:36,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:36,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 04:10:36,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:37,802 INFO L130 PetriNetUnfolder]: 12095/17646 cut-off events. [2022-12-06 04:10:37,802 INFO L131 PetriNetUnfolder]: For 98172/99220 co-relation queries the response was YES. [2022-12-06 04:10:37,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79822 conditions, 17646 events. 12095/17646 cut-off events. For 98172/99220 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 109665 event pairs, 2433 based on Foata normal form. 250/17198 useless extension candidates. Maximal degree in co-relation 79784. Up to 14192 conditions per place. [2022-12-06 04:10:37,916 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 100 selfloop transitions, 27 changer transitions 4/141 dead transitions. [2022-12-06 04:10:37,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 141 transitions, 1587 flow [2022-12-06 04:10:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-06 04:10:37,917 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2022-12-06 04:10:37,917 INFO L175 Difference]: Start difference. First operand has 83 places, 104 transitions, 1143 flow. Second operand 6 states and 93 transitions. [2022-12-06 04:10:37,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 141 transitions, 1587 flow [2022-12-06 04:10:38,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 141 transitions, 1552 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:38,080 INFO L231 Difference]: Finished difference. Result has 87 places, 106 transitions, 1195 flow [2022-12-06 04:10:38,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1108, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1195, PETRI_PLACES=87, PETRI_TRANSITIONS=106} [2022-12-06 04:10:38,081 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 42 predicate places. [2022-12-06 04:10:38,081 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:38,081 INFO L89 Accepts]: Start accepts. Operand has 87 places, 106 transitions, 1195 flow [2022-12-06 04:10:38,082 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:38,082 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:38,082 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 106 transitions, 1195 flow [2022-12-06 04:10:38,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 106 transitions, 1195 flow [2022-12-06 04:10:38,309 INFO L130 PetriNetUnfolder]: 1459/2784 cut-off events. [2022-12-06 04:10:38,309 INFO L131 PetriNetUnfolder]: For 15988/16490 co-relation queries the response was YES. [2022-12-06 04:10:38,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13468 conditions, 2784 events. 1459/2784 cut-off events. For 15988/16490 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 20483 event pairs, 370 based on Foata normal form. 66/2765 useless extension candidates. Maximal degree in co-relation 13432. Up to 1971 conditions per place. [2022-12-06 04:10:38,340 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 106 transitions, 1195 flow [2022-12-06 04:10:38,341 INFO L188 LiptonReduction]: Number of co-enabled transitions 928 [2022-12-06 04:10:38,361 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:38,362 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 281 [2022-12-06 04:10:38,362 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 106 transitions, 1195 flow [2022-12-06 04:10:38,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:38,362 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:38,362 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:38,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 04:10:38,362 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:38,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:38,363 INFO L85 PathProgramCache]: Analyzing trace with hash 280272764, now seen corresponding path program 2 times [2022-12-06 04:10:38,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:38,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678637431] [2022-12-06 04:10:38,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:38,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:38,809 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-06 04:10:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:38,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678637431] [2022-12-06 04:10:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678637431] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:38,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:38,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357597223] [2022-12-06 04:10:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:38,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:38,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:38,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 04:10:38,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 106 transitions, 1195 flow. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 04:10:38,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:38,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 04:10:38,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:40,877 INFO L130 PetriNetUnfolder]: 16297/22794 cut-off events. [2022-12-06 04:10:40,877 INFO L131 PetriNetUnfolder]: For 109324/109324 co-relation queries the response was YES. [2022-12-06 04:10:40,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103081 conditions, 22794 events. 16297/22794 cut-off events. For 109324/109324 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 129126 event pairs, 2407 based on Foata normal form. 16/22810 useless extension candidates. Maximal degree in co-relation 103042. Up to 19349 conditions per place. [2022-12-06 04:10:41,050 INFO L137 encePairwiseOnDemand]: 18/33 looper letters, 142 selfloop transitions, 48 changer transitions 31/221 dead transitions. [2022-12-06 04:10:41,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 221 transitions, 2487 flow [2022-12-06 04:10:41,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:10:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:10:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2022-12-06 04:10:41,052 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 04:10:41,052 INFO L175 Difference]: Start difference. First operand has 87 places, 106 transitions, 1195 flow. Second operand 8 states and 110 transitions. [2022-12-06 04:10:41,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 221 transitions, 2487 flow [2022-12-06 04:10:41,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 221 transitions, 2430 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 04:10:41,328 INFO L231 Difference]: Finished difference. Result has 94 places, 127 transitions, 1528 flow [2022-12-06 04:10:41,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1528, PETRI_PLACES=94, PETRI_TRANSITIONS=127} [2022-12-06 04:10:41,333 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2022-12-06 04:10:41,334 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:41,334 INFO L89 Accepts]: Start accepts. Operand has 94 places, 127 transitions, 1528 flow [2022-12-06 04:10:41,335 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:41,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:41,335 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 127 transitions, 1528 flow [2022-12-06 04:10:41,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 127 transitions, 1528 flow [2022-12-06 04:10:41,589 INFO L130 PetriNetUnfolder]: 1526/3012 cut-off events. [2022-12-06 04:10:41,589 INFO L131 PetriNetUnfolder]: For 21100/21851 co-relation queries the response was YES. [2022-12-06 04:10:41,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16323 conditions, 3012 events. 1526/3012 cut-off events. For 21100/21851 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 23110 event pairs, 301 based on Foata normal form. 85/3040 useless extension candidates. Maximal degree in co-relation 16283. Up to 2056 conditions per place. [2022-12-06 04:10:41,628 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 127 transitions, 1528 flow [2022-12-06 04:10:41,628 INFO L188 LiptonReduction]: Number of co-enabled transitions 1068 [2022-12-06 04:10:41,716 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:41,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 382 [2022-12-06 04:10:41,716 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 127 transitions, 1532 flow [2022-12-06 04:10:41,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-06 04:10:41,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:41,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:41,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-06 04:10:41,717 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:41,717 INFO L85 PathProgramCache]: Analyzing trace with hash 169419492, now seen corresponding path program 1 times [2022-12-06 04:10:41,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:41,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283555225] [2022-12-06 04:10:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:41,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:42,171 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-06 04:10:42,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:42,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283555225] [2022-12-06 04:10:42,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283555225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:42,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:42,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973408867] [2022-12-06 04:10:42,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:42,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:42,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:42,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:42,172 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-06 04:10:42,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 127 transitions, 1532 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:42,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:42,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-06 04:10:42,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:44,251 INFO L130 PetriNetUnfolder]: 12625/18715 cut-off events. [2022-12-06 04:10:44,251 INFO L131 PetriNetUnfolder]: For 134169/134995 co-relation queries the response was YES. [2022-12-06 04:10:44,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94114 conditions, 18715 events. 12625/18715 cut-off events. For 134169/134995 co-relation queries the response was YES. Maximal size of possible extension queue 968. Compared 119967 event pairs, 2398 based on Foata normal form. 211/18429 useless extension candidates. Maximal degree in co-relation 94071. Up to 13148 conditions per place. [2022-12-06 04:10:44,449 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 92 selfloop transitions, 62 changer transitions 4/172 dead transitions. [2022-12-06 04:10:44,449 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 172 transitions, 2094 flow [2022-12-06 04:10:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:10:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:10:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-12-06 04:10:44,450 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2022-12-06 04:10:44,450 INFO L175 Difference]: Start difference. First operand has 94 places, 127 transitions, 1532 flow. Second operand 7 states and 107 transitions. [2022-12-06 04:10:44,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 172 transitions, 2094 flow [2022-12-06 04:10:44,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 172 transitions, 2029 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:44,837 INFO L231 Difference]: Finished difference. Result has 98 places, 129 transitions, 1672 flow [2022-12-06 04:10:44,837 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1672, PETRI_PLACES=98, PETRI_TRANSITIONS=129} [2022-12-06 04:10:44,837 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2022-12-06 04:10:44,837 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:44,837 INFO L89 Accepts]: Start accepts. Operand has 98 places, 129 transitions, 1672 flow [2022-12-06 04:10:44,838 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:44,838 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:44,838 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 129 transitions, 1672 flow [2022-12-06 04:10:44,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 129 transitions, 1672 flow [2022-12-06 04:10:45,105 INFO L130 PetriNetUnfolder]: 1531/3056 cut-off events. [2022-12-06 04:10:45,105 INFO L131 PetriNetUnfolder]: For 23914/24574 co-relation queries the response was YES. [2022-12-06 04:10:45,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17351 conditions, 3056 events. 1531/3056 cut-off events. For 23914/24574 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 23781 event pairs, 378 based on Foata normal form. 89/3094 useless extension candidates. Maximal degree in co-relation 17310. Up to 2075 conditions per place. [2022-12-06 04:10:45,140 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 129 transitions, 1672 flow [2022-12-06 04:10:45,140 INFO L188 LiptonReduction]: Number of co-enabled transitions 1080 [2022-12-06 04:10:45,628 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L819-->L822: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:45,744 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:10:45,748 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 911 [2022-12-06 04:10:45,748 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 129 transitions, 1681 flow [2022-12-06 04:10:45,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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-06 04:10:45,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:45,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:45,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-06 04:10:45,748 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:45,749 INFO L85 PathProgramCache]: Analyzing trace with hash -959701634, now seen corresponding path program 1 times [2022-12-06 04:10:45,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:45,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108336821] [2022-12-06 04:10:45,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:45,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:46,205 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-06 04:10:46,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:46,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108336821] [2022-12-06 04:10:46,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108336821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:46,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:46,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337921625] [2022-12-06 04:10:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:46,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:10:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:46,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:10:46,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:10:46,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-06 04:10:46,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 129 transitions, 1681 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-06 04:10:46,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:46,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-06 04:10:46,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:48,473 INFO L130 PetriNetUnfolder]: 14001/20762 cut-off events. [2022-12-06 04:10:48,473 INFO L131 PetriNetUnfolder]: For 163977/164862 co-relation queries the response was YES. [2022-12-06 04:10:48,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106317 conditions, 20762 events. 14001/20762 cut-off events. For 163977/164862 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 134755 event pairs, 2723 based on Foata normal form. 232/20442 useless extension candidates. Maximal degree in co-relation 106273. Up to 12187 conditions per place. [2022-12-06 04:10:48,722 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 100 selfloop transitions, 46 changer transitions 7/166 dead transitions. [2022-12-06 04:10:48,722 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 166 transitions, 2227 flow [2022-12-06 04:10:48,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 04:10:48,724 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:10:48,724 INFO L175 Difference]: Start difference. First operand has 99 places, 129 transitions, 1681 flow. Second operand 5 states and 85 transitions. [2022-12-06 04:10:48,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 166 transitions, 2227 flow [2022-12-06 04:10:49,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 166 transitions, 2118 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-06 04:10:49,117 INFO L231 Difference]: Finished difference. Result has 98 places, 127 transitions, 1694 flow [2022-12-06 04:10:49,117 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1572, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1694, PETRI_PLACES=98, PETRI_TRANSITIONS=127} [2022-12-06 04:10:49,118 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2022-12-06 04:10:49,118 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:49,118 INFO L89 Accepts]: Start accepts. Operand has 98 places, 127 transitions, 1694 flow [2022-12-06 04:10:49,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:49,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:49,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 127 transitions, 1694 flow [2022-12-06 04:10:49,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 127 transitions, 1694 flow [2022-12-06 04:10:49,377 INFO L130 PetriNetUnfolder]: 1473/2996 cut-off events. [2022-12-06 04:10:49,377 INFO L131 PetriNetUnfolder]: For 25417/26070 co-relation queries the response was YES. [2022-12-06 04:10:49,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17212 conditions, 2996 events. 1473/2996 cut-off events. For 25417/26070 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 23760 event pairs, 382 based on Foata normal form. 92/3038 useless extension candidates. Maximal degree in co-relation 17171. Up to 2014 conditions per place. [2022-12-06 04:10:49,411 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 127 transitions, 1694 flow [2022-12-06 04:10:49,411 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-06 04:10:49,426 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L766-->L776: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd2~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_94 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_457 256) 0)))) (let ((.cse0 (and .cse5 .cse3)) (.cse2 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_458 256) 0)))) (.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_419 256) 0))))) (and (= v_~y$w_buff1_used~0_418 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_419)) (= (ite .cse0 0 v_~y$r_buff0_thd2~0_94) v_~y$r_buff0_thd2~0_93) (= v_~y$w_buff0_used~0_457 (ite .cse2 0 v_~y$w_buff0_used~0_458)) (= v_~y~0_375 (ite .cse2 v_~y$w_buff0~0_294 (ite .cse1 v_~y$w_buff1~0_283 1))) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_93 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_418 256) 0)))) 0 v_~y$r_buff1_thd2~0_97) v_~y$r_buff1_thd2~0_96)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_97, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_283, ~y$w_buff0~0=v_~y$w_buff0~0_294, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_419} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_96, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_457, ~y$w_buff1~0=v_~y$w_buff1~0_283, ~y$w_buff0~0=v_~y$w_buff0~0_294, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_93, ~y~0=v_~y~0_375, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_418} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:49,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] and [479] $Ultimate##0-->L796: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_228 256) 0)) (not (= (mod v_~y$w_buff0_used~0_253 256) 0)))) 1 0) |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (not (= 0 |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|)) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_19) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= v_~y$r_buff0_thd0~0_137 v_~y$r_buff1_thd0~0_133) (= v_~y$r_buff0_thd3~0_67 v_~y$r_buff1_thd3~0_53) (= v_~y$w_buff0_used~0_254 v_~y$w_buff1_used~0_228) (= v_~y$w_buff0_used~0_253 1) (= v_~y$r_buff0_thd4~0_49 v_~y$r_buff1_thd4~0_47) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff1_thd2~0_49) (= |v_P2Thread1of1ForFork2_~arg#1.offset_7| |v_P2Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~y$r_buff0_thd3~0_66 1) (= 2 v_~y$w_buff0~0_145) (= |v_P2Thread1of1ForFork2_#in~arg#1.base_7| |v_P2Thread1of1ForFork2_~arg#1.base_7|) (= v_~y$w_buff1~0_150 v_~y$w_buff0~0_146)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_67, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_146, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_253, P2Thread1of1ForFork2_~arg#1.offset=|v_P2Thread1of1ForFork2_~arg#1.offset_7|, P2Thread1of1ForFork2_#in~arg#1.offset=|v_P2Thread1of1ForFork2_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_49, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, P2Thread1of1ForFork2_#in~arg#1.base=|v_P2Thread1of1ForFork2_#in~arg#1.base_7|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_47, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_53, ~y$w_buff1~0=v_~y$w_buff1~0_150, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_66, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_137, ~y$w_buff0~0=v_~y$w_buff0~0_145, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork2_~arg#1.base=|v_P2Thread1of1ForFork2_~arg#1.base_7|, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork2_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork2_~arg#1.base, P2Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-06 04:10:49,783 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:49,787 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 669 [2022-12-06 04:10:49,787 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 127 transitions, 1716 flow [2022-12-06 04:10:49,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 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-06 04:10:49,787 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:49,787 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:49,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-06 04:10:49,787 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 816050118, now seen corresponding path program 1 times [2022-12-06 04:10:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:49,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227077164] [2022-12-06 04:10:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:49,895 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-06 04:10:49,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:49,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227077164] [2022-12-06 04:10:49,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227077164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:49,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:49,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443045804] [2022-12-06 04:10:49,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:49,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:49,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:49,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:49,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:49,896 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2022-12-06 04:10:49,896 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 127 transitions, 1716 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-06 04:10:49,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:49,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2022-12-06 04:10:49,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:51,652 INFO L130 PetriNetUnfolder]: 10472/16081 cut-off events. [2022-12-06 04:10:51,652 INFO L131 PetriNetUnfolder]: For 206772/208675 co-relation queries the response was YES. [2022-12-06 04:10:51,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83572 conditions, 16081 events. 10472/16081 cut-off events. For 206772/208675 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 112514 event pairs, 2148 based on Foata normal form. 2657/18240 useless extension candidates. Maximal degree in co-relation 83528. Up to 9718 conditions per place. [2022-12-06 04:10:51,795 INFO L137 encePairwiseOnDemand]: 26/34 looper letters, 213 selfloop transitions, 10 changer transitions 33/274 dead transitions. [2022-12-06 04:10:51,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 274 transitions, 4137 flow [2022-12-06 04:10:51,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-06 04:10:51,797 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2022-12-06 04:10:51,797 INFO L175 Difference]: Start difference. First operand has 96 places, 127 transitions, 1716 flow. Second operand 5 states and 108 transitions. [2022-12-06 04:10:51,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 274 transitions, 4137 flow [2022-12-06 04:10:52,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 274 transitions, 3922 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:52,234 INFO L231 Difference]: Finished difference. Result has 100 places, 127 transitions, 1580 flow [2022-12-06 04:10:52,235 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1580, PETRI_PLACES=100, PETRI_TRANSITIONS=127} [2022-12-06 04:10:52,235 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2022-12-06 04:10:52,235 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:52,235 INFO L89 Accepts]: Start accepts. Operand has 100 places, 127 transitions, 1580 flow [2022-12-06 04:10:52,236 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:52,236 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:52,236 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 127 transitions, 1580 flow [2022-12-06 04:10:52,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 127 transitions, 1580 flow [2022-12-06 04:10:52,826 INFO L130 PetriNetUnfolder]: 3883/7097 cut-off events. [2022-12-06 04:10:52,826 INFO L131 PetriNetUnfolder]: For 61495/64513 co-relation queries the response was YES. [2022-12-06 04:10:52,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34334 conditions, 7097 events. 3883/7097 cut-off events. For 61495/64513 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 61437 event pairs, 1388 based on Foata normal form. 300/6696 useless extension candidates. Maximal degree in co-relation 34290. Up to 4155 conditions per place. [2022-12-06 04:10:52,924 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 127 transitions, 1580 flow [2022-12-06 04:10:52,924 INFO L188 LiptonReduction]: Number of co-enabled transitions 1376 [2022-12-06 04:10:52,933 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_37|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [434] L776-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P1Thread1of1ForFork1_#res.offset_13| 0) (= |v_P1Thread1of1ForFork1_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] [2022-12-06 04:10:52,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_37|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [462] L829-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= |v_P3Thread1of1ForFork0_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_9|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:10:52,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_37|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [492] L754-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_163 (+ v_~__unbuffered_cnt~0_164 1)) (= |v_P0Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_164} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_163, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-06 04:10:53,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] L853-3-->L3: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_17| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_171 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_44) (= (mod v_~main$tmp_guard0~0_44 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_37|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_31|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_171, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_44, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [484] L806-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_137 (+ v_~__unbuffered_cnt~0_138 1)) (= |v_P2Thread1of1ForFork2_#res#1.base_17| 0) (= |v_P2Thread1of1ForFork2_#res#1.offset_17| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138} OutVars{P2Thread1of1ForFork2_#res#1.offset=|v_P2Thread1of1ForFork2_#res#1.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, P2Thread1of1ForFork2_#res#1.base=|v_P2Thread1of1ForFork2_#res#1.base_17|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res#1.base] [2022-12-06 04:10:53,079 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:53,079 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 844 [2022-12-06 04:10:53,080 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 126 transitions, 1590 flow [2022-12-06 04:10:53,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-06 04:10:53,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:53,080 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:53,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-06 04:10:53,080 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1834070375, now seen corresponding path program 1 times [2022-12-06 04:10:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:53,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779476412] [2022-12-06 04:10:53,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:53,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:53,218 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-06 04:10:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:53,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779476412] [2022-12-06 04:10:53,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779476412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:53,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:53,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545538074] [2022-12-06 04:10:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:53,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:53,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:53,220 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 38 [2022-12-06 04:10:53,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 126 transitions, 1590 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-06 04:10:53,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:53,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 38 [2022-12-06 04:10:53,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:54,563 INFO L130 PetriNetUnfolder]: 7242/11812 cut-off events. [2022-12-06 04:10:54,563 INFO L131 PetriNetUnfolder]: For 146036/148550 co-relation queries the response was YES. [2022-12-06 04:10:54,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64409 conditions, 11812 events. 7242/11812 cut-off events. For 146036/148550 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 86859 event pairs, 691 based on Foata normal form. 1911/13406 useless extension candidates. Maximal degree in co-relation 64362. Up to 5291 conditions per place. [2022-12-06 04:10:54,641 INFO L137 encePairwiseOnDemand]: 26/38 looper letters, 193 selfloop transitions, 18 changer transitions 18/245 dead transitions. [2022-12-06 04:10:54,641 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 245 transitions, 3309 flow [2022-12-06 04:10:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2022-12-06 04:10:54,642 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2022-12-06 04:10:54,642 INFO L175 Difference]: Start difference. First operand has 99 places, 126 transitions, 1590 flow. Second operand 6 states and 126 transitions. [2022-12-06 04:10:54,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 245 transitions, 3309 flow [2022-12-06 04:10:54,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 245 transitions, 3068 flow, removed 64 selfloop flow, removed 9 redundant places. [2022-12-06 04:10:54,725 INFO L231 Difference]: Finished difference. Result has 94 places, 99 transitions, 1088 flow [2022-12-06 04:10:54,725 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1088, PETRI_PLACES=94, PETRI_TRANSITIONS=99} [2022-12-06 04:10:54,732 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2022-12-06 04:10:54,732 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:54,733 INFO L89 Accepts]: Start accepts. Operand has 94 places, 99 transitions, 1088 flow [2022-12-06 04:10:54,737 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:54,737 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:54,737 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 99 transitions, 1088 flow [2022-12-06 04:10:54,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 99 transitions, 1088 flow [2022-12-06 04:10:55,143 INFO L130 PetriNetUnfolder]: 2346/5070 cut-off events. [2022-12-06 04:10:55,144 INFO L131 PetriNetUnfolder]: For 43170/49379 co-relation queries the response was YES. [2022-12-06 04:10:55,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27735 conditions, 5070 events. 2346/5070 cut-off events. For 43170/49379 co-relation queries the response was YES. Maximal size of possible extension queue 781. Compared 48071 event pairs, 403 based on Foata normal form. 362/5016 useless extension candidates. Maximal degree in co-relation 27693. Up to 3536 conditions per place. [2022-12-06 04:10:55,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 99 transitions, 1088 flow [2022-12-06 04:10:55,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-06 04:10:55,217 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:55,219 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 487 [2022-12-06 04:10:55,219 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 99 transitions, 1088 flow [2022-12-06 04:10:55,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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-06 04:10:55,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:55,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:55,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-06 04:10:55,219 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1921333213, now seen corresponding path program 1 times [2022-12-06 04:10:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:55,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339360112] [2022-12-06 04:10:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:55,802 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-06 04:10:55,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:55,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339360112] [2022-12-06 04:10:55,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339360112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:55,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:55,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957124245] [2022-12-06 04:10:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:55,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:55,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:55,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:55,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 04:10:55,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 99 transitions, 1088 flow. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-06 04:10:55,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:55,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 04:10:55,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:57,383 INFO L130 PetriNetUnfolder]: 8913/14414 cut-off events. [2022-12-06 04:10:57,383 INFO L131 PetriNetUnfolder]: For 116096/117544 co-relation queries the response was YES. [2022-12-06 04:10:57,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84512 conditions, 14414 events. 8913/14414 cut-off events. For 116096/117544 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 104718 event pairs, 1202 based on Foata normal form. 424/14534 useless extension candidates. Maximal degree in co-relation 84467. Up to 8851 conditions per place. [2022-12-06 04:10:57,522 INFO L137 encePairwiseOnDemand]: 27/35 looper letters, 118 selfloop transitions, 32 changer transitions 15/178 dead transitions. [2022-12-06 04:10:57,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 178 transitions, 2172 flow [2022-12-06 04:10:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:57,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:57,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2022-12-06 04:10:57,524 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-06 04:10:57,524 INFO L175 Difference]: Start difference. First operand has 94 places, 99 transitions, 1088 flow. Second operand 5 states and 98 transitions. [2022-12-06 04:10:57,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 178 transitions, 2172 flow [2022-12-06 04:10:58,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 178 transitions, 2030 flow, removed 52 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:58,660 INFO L231 Difference]: Finished difference. Result has 98 places, 105 transitions, 1253 flow [2022-12-06 04:10:58,660 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1253, PETRI_PLACES=98, PETRI_TRANSITIONS=105} [2022-12-06 04:10:58,661 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2022-12-06 04:10:58,661 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:58,661 INFO L89 Accepts]: Start accepts. Operand has 98 places, 105 transitions, 1253 flow [2022-12-06 04:10:58,661 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:58,661 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:58,662 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 105 transitions, 1253 flow [2022-12-06 04:10:58,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 105 transitions, 1253 flow [2022-12-06 04:10:59,047 INFO L130 PetriNetUnfolder]: 2250/5094 cut-off events. [2022-12-06 04:10:59,047 INFO L131 PetriNetUnfolder]: For 55669/58018 co-relation queries the response was YES. [2022-12-06 04:10:59,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26243 conditions, 5094 events. 2250/5094 cut-off events. For 55669/58018 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 49469 event pairs, 452 based on Foata normal form. 427/5185 useless extension candidates. Maximal degree in co-relation 26199. Up to 2273 conditions per place. [2022-12-06 04:10:59,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 105 transitions, 1253 flow [2022-12-06 04:10:59,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 1524 [2022-12-06 04:10:59,649 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:10:59,649 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 988 [2022-12-06 04:10:59,650 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 104 transitions, 1225 flow [2022-12-06 04:10:59,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-06 04:10:59,650 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:59,650 INFO L213 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-06 04:10:59,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 04:10:59,650 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:59,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1573988394, now seen corresponding path program 1 times [2022-12-06 04:10:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857401427] [2022-12-06 04:10:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:59,786 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-06 04:10:59,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:59,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857401427] [2022-12-06 04:10:59,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857401427] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:59,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:59,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:59,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265942639] [2022-12-06 04:10:59,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:59,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:59,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:59,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:59,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:59,789 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2022-12-06 04:10:59,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 104 transitions, 1225 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:59,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:59,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2022-12-06 04:10:59,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:01,062 INFO L130 PetriNetUnfolder]: 6634/11159 cut-off events. [2022-12-06 04:11:01,063 INFO L131 PetriNetUnfolder]: For 131934/134288 co-relation queries the response was YES. [2022-12-06 04:11:01,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62415 conditions, 11159 events. 6634/11159 cut-off events. For 131934/134288 co-relation queries the response was YES. Maximal size of possible extension queue 931. Compared 85745 event pairs, 507 based on Foata normal form. 1610/12424 useless extension candidates. Maximal degree in co-relation 62368. Up to 4592 conditions per place. [2022-12-06 04:11:01,177 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 202 selfloop transitions, 25 changer transitions 49/292 dead transitions. [2022-12-06 04:11:01,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 292 transitions, 4032 flow [2022-12-06 04:11:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:11:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:11:01,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2022-12-06 04:11:01,180 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2022-12-06 04:11:01,180 INFO L175 Difference]: Start difference. First operand has 98 places, 104 transitions, 1225 flow. Second operand 8 states and 156 transitions. [2022-12-06 04:11:01,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 292 transitions, 4032 flow [2022-12-06 04:11:01,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 292 transitions, 3832 flow, removed 44 selfloop flow, removed 5 redundant places. [2022-12-06 04:11:01,748 INFO L231 Difference]: Finished difference. Result has 102 places, 105 transitions, 1209 flow [2022-12-06 04:11:01,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1209, PETRI_PLACES=102, PETRI_TRANSITIONS=105} [2022-12-06 04:11:01,749 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 57 predicate places. [2022-12-06 04:11:01,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:01,749 INFO L89 Accepts]: Start accepts. Operand has 102 places, 105 transitions, 1209 flow [2022-12-06 04:11:01,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:01,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:01,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 105 transitions, 1209 flow [2022-12-06 04:11:01,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 105 transitions, 1209 flow [2022-12-06 04:11:02,203 INFO L130 PetriNetUnfolder]: 1525/4025 cut-off events. [2022-12-06 04:11:02,203 INFO L131 PetriNetUnfolder]: For 29314/31569 co-relation queries the response was YES. [2022-12-06 04:11:02,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20398 conditions, 4025 events. 1525/4025 cut-off events. For 29314/31569 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 41959 event pairs, 134 based on Foata normal form. 246/4025 useless extension candidates. Maximal degree in co-relation 20353. Up to 2000 conditions per place. [2022-12-06 04:11:02,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 105 transitions, 1209 flow [2022-12-06 04:11:02,248 INFO L188 LiptonReduction]: Number of co-enabled transitions 1584 [2022-12-06 04:11:02,251 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:02,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 503 [2022-12-06 04:11:02,252 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 105 transitions, 1209 flow [2022-12-06 04:11:02,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:02,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:02,252 INFO L213 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-06 04:11:02,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-06 04:11:02,252 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:02,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash -149646914, now seen corresponding path program 1 times [2022-12-06 04:11:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:02,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495504454] [2022-12-06 04:11:02,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:02,393 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-06 04:11:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:02,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495504454] [2022-12-06 04:11:02,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495504454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:02,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:02,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:11:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879914731] [2022-12-06 04:11:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:02,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:11:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:11:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:11:02,395 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2022-12-06 04:11:02,395 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 105 transitions, 1209 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-06 04:11:02,395 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:02,395 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2022-12-06 04:11:02,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:03,712 INFO L130 PetriNetUnfolder]: 6296/10714 cut-off events. [2022-12-06 04:11:03,712 INFO L131 PetriNetUnfolder]: For 97023/99147 co-relation queries the response was YES. [2022-12-06 04:11:03,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62333 conditions, 10714 events. 6296/10714 cut-off events. For 97023/99147 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 84087 event pairs, 459 based on Foata normal form. 990/11355 useless extension candidates. Maximal degree in co-relation 62285. Up to 4259 conditions per place. [2022-12-06 04:11:03,788 INFO L137 encePairwiseOnDemand]: 24/34 looper letters, 169 selfloop transitions, 30 changer transitions 67/277 dead transitions. [2022-12-06 04:11:03,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 277 transitions, 3687 flow [2022-12-06 04:11:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 04:11:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 04:11:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2022-12-06 04:11:03,790 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49117647058823527 [2022-12-06 04:11:03,790 INFO L175 Difference]: Start difference. First operand has 102 places, 105 transitions, 1209 flow. Second operand 10 states and 167 transitions. [2022-12-06 04:11:03,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 277 transitions, 3687 flow [2022-12-06 04:11:04,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 277 transitions, 3564 flow, removed 36 selfloop flow, removed 5 redundant places. [2022-12-06 04:11:04,964 INFO L231 Difference]: Finished difference. Result has 109 places, 89 transitions, 974 flow [2022-12-06 04:11:04,964 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=974, PETRI_PLACES=109, PETRI_TRANSITIONS=89} [2022-12-06 04:11:04,965 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 64 predicate places. [2022-12-06 04:11:04,965 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:04,965 INFO L89 Accepts]: Start accepts. Operand has 109 places, 89 transitions, 974 flow [2022-12-06 04:11:04,966 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:04,966 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:04,966 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 89 transitions, 974 flow [2022-12-06 04:11:04,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 89 transitions, 974 flow [2022-12-06 04:11:05,028 INFO L130 PetriNetUnfolder]: 285/802 cut-off events. [2022-12-06 04:11:05,029 INFO L131 PetriNetUnfolder]: For 4699/4993 co-relation queries the response was YES. [2022-12-06 04:11:05,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3860 conditions, 802 events. 285/802 cut-off events. For 4699/4993 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6141 event pairs, 25 based on Foata normal form. 44/790 useless extension candidates. Maximal degree in co-relation 3820. Up to 198 conditions per place. [2022-12-06 04:11:05,037 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 89 transitions, 974 flow [2022-12-06 04:11:05,037 INFO L188 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-06 04:11:05,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] and [381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:11:05,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] and [373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:11:06,022 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [366] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [464] $Ultimate##0-->L766: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= v_~x~0_46 2)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] [2022-12-06 04:11:11,631 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:11:11,631 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6666 [2022-12-06 04:11:11,631 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 79 transitions, 911 flow [2022-12-06 04:11:11,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 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-06 04:11:11,631 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:11,631 INFO L213 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-06 04:11:11,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-06 04:11:11,632 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:11,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1856734530, now seen corresponding path program 1 times [2022-12-06 04:11:11,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:11,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845772171] [2022-12-06 04:11:11,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:11,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:11,735 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-06 04:11:11,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:11,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845772171] [2022-12-06 04:11:11,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845772171] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:11,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:11,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:11:11,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970939753] [2022-12-06 04:11:11,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:11,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:11:11,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:11,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:11:11,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:11:11,737 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-06 04:11:11,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 79 transitions, 911 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:11,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:11,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-06 04:11:11,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:11,947 INFO L130 PetriNetUnfolder]: 966/1624 cut-off events. [2022-12-06 04:11:11,947 INFO L131 PetriNetUnfolder]: For 11773/11810 co-relation queries the response was YES. [2022-12-06 04:11:11,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9514 conditions, 1624 events. 966/1624 cut-off events. For 11773/11810 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8140 event pairs, 206 based on Foata normal form. 13/1628 useless extension candidates. Maximal degree in co-relation 9464. Up to 977 conditions per place. [2022-12-06 04:11:11,956 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 55 selfloop transitions, 1 changer transitions 73/134 dead transitions. [2022-12-06 04:11:11,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 134 transitions, 1799 flow [2022-12-06 04:11:11,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:11:11,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:11:11,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-12-06 04:11:11,958 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-06 04:11:11,958 INFO L175 Difference]: Start difference. First operand has 102 places, 79 transitions, 911 flow. Second operand 4 states and 64 transitions. [2022-12-06 04:11:11,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 134 transitions, 1799 flow [2022-12-06 04:11:11,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 134 transitions, 1574 flow, removed 62 selfloop flow, removed 16 redundant places. [2022-12-06 04:11:11,979 INFO L231 Difference]: Finished difference. Result has 84 places, 53 transitions, 483 flow [2022-12-06 04:11:11,979 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=483, PETRI_PLACES=84, PETRI_TRANSITIONS=53} [2022-12-06 04:11:11,980 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2022-12-06 04:11:11,980 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:11,980 INFO L89 Accepts]: Start accepts. Operand has 84 places, 53 transitions, 483 flow [2022-12-06 04:11:11,980 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:11,981 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:11,981 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 53 transitions, 483 flow [2022-12-06 04:11:11,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 53 transitions, 483 flow [2022-12-06 04:11:11,994 INFO L130 PetriNetUnfolder]: 76/192 cut-off events. [2022-12-06 04:11:11,994 INFO L131 PetriNetUnfolder]: For 1349/1377 co-relation queries the response was YES. [2022-12-06 04:11:11,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 192 events. 76/192 cut-off events. For 1349/1377 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 864 event pairs, 6 based on Foata normal form. 14/194 useless extension candidates. Maximal degree in co-relation 739. Up to 62 conditions per place. [2022-12-06 04:11:11,996 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 53 transitions, 483 flow [2022-12-06 04:11:11,996 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 04:11:12,119 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:11:12,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [372] L766-->L769: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:11:12,375 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:11:12,376 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 396 [2022-12-06 04:11:12,376 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 49 transitions, 490 flow [2022-12-06 04:11:12,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:11:12,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:12,376 INFO L213 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-06 04:11:12,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-06 04:11:12,376 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:12,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1603871519, now seen corresponding path program 1 times [2022-12-06 04:11:12,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:12,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833767885] [2022-12-06 04:11:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:11:13,193 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-06 04:11:13,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:11:13,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833767885] [2022-12-06 04:11:13,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833767885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:11:13,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:11:13,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:11:13,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39124575] [2022-12-06 04:11:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:11:13,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 04:11:13,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:11:13,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 04:11:13,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 04:11:13,194 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 04:11:13,194 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 49 transitions, 490 flow. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-06 04:11:13,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:11:13,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 04:11:13,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:11:13,415 INFO L130 PetriNetUnfolder]: 298/518 cut-off events. [2022-12-06 04:11:13,415 INFO L131 PetriNetUnfolder]: For 2877/2877 co-relation queries the response was YES. [2022-12-06 04:11:13,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2621 conditions, 518 events. 298/518 cut-off events. For 2877/2877 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2190 event pairs, 33 based on Foata normal form. 1/519 useless extension candidates. Maximal degree in co-relation 2582. Up to 200 conditions per place. [2022-12-06 04:11:13,418 INFO L137 encePairwiseOnDemand]: 16/25 looper letters, 64 selfloop transitions, 8 changer transitions 38/110 dead transitions. [2022-12-06 04:11:13,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 1121 flow [2022-12-06 04:11:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:11:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:11:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2022-12-06 04:11:13,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32571428571428573 [2022-12-06 04:11:13,419 INFO L175 Difference]: Start difference. First operand has 76 places, 49 transitions, 490 flow. Second operand 7 states and 57 transitions. [2022-12-06 04:11:13,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 1121 flow [2022-12-06 04:11:13,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 110 transitions, 991 flow, removed 32 selfloop flow, removed 15 redundant places. [2022-12-06 04:11:13,424 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 375 flow [2022-12-06 04:11:13,424 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=375, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2022-12-06 04:11:13,424 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2022-12-06 04:11:13,424 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:11:13,424 INFO L89 Accepts]: Start accepts. Operand has 70 places, 46 transitions, 375 flow [2022-12-06 04:11:13,425 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:11:13,425 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:11:13,425 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 46 transitions, 375 flow [2022-12-06 04:11:13,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 46 transitions, 375 flow [2022-12-06 04:11:13,435 INFO L130 PetriNetUnfolder]: 70/162 cut-off events. [2022-12-06 04:11:13,435 INFO L131 PetriNetUnfolder]: For 648/667 co-relation queries the response was YES. [2022-12-06 04:11:13,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 162 events. 70/162 cut-off events. For 648/667 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 732 event pairs, 2 based on Foata normal form. 8/158 useless extension candidates. Maximal degree in co-relation 571. Up to 57 conditions per place. [2022-12-06 04:11:13,436 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 46 transitions, 375 flow [2022-12-06 04:11:13,436 INFO L188 LiptonReduction]: Number of co-enabled transitions 176 [2022-12-06 04:11:13,437 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:11:13,437 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 04:11:13,437 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 375 flow [2022-12-06 04:11:13,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-06 04:11:13,438 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:11:13,438 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:13,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-06 04:11:13,438 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:11:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:11:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash 466589103, now seen corresponding path program 1 times [2022-12-06 04:11:13,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:11:13,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997748394] [2022-12-06 04:11:13,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:11:13,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:11:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:11:13,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:11:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:11:13,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:11:13,497 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:11:13,498 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:11:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:11:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:11:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:11:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:11:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:11:13,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:11:13,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-06 04:11:13,500 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:11:13,503 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:11:13,503 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:11:13,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:11:13 BasicIcfg [2022-12-06 04:11:13,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:11:13,567 INFO L158 Benchmark]: Toolchain (without parser) took 79517.48ms. Allocated memory was 175.1MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 150.2MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 04:11:13,567 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:11:13,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.73ms. Allocated memory is still 175.1MB. Free memory was 150.2MB in the beginning and 122.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:11:13,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.93ms. Allocated memory is still 175.1MB. Free memory was 122.4MB in the beginning and 119.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:11:13,567 INFO L158 Benchmark]: Boogie Preprocessor took 33.22ms. Allocated memory is still 175.1MB. Free memory was 119.3MB in the beginning and 117.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:11:13,567 INFO L158 Benchmark]: RCFGBuilder took 744.68ms. Allocated memory is still 175.1MB. Free memory was 117.2MB in the beginning and 81.0MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2022-12-06 04:11:13,568 INFO L158 Benchmark]: TraceAbstraction took 78171.58ms. Allocated memory was 175.1MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 80.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-12-06 04:11:13,568 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 175.1MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.73ms. Allocated memory is still 175.1MB. Free memory was 150.2MB in the beginning and 122.4MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.93ms. Allocated memory is still 175.1MB. Free memory was 122.4MB in the beginning and 119.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.22ms. Allocated memory is still 175.1MB. Free memory was 119.3MB in the beginning and 117.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 744.68ms. Allocated memory is still 175.1MB. Free memory was 117.2MB in the beginning and 81.0MB in the end (delta: 36.2MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 78171.58ms. Allocated memory was 175.1MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 80.5MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 136 PlacesBefore, 45 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 2084, 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: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, 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: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, 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: 1869, independent: 1822, independent conditional: 0, independent unconditional: 1822, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1869, independent: 1794, independent conditional: 0, independent unconditional: 1794, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 198, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2156, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 1869, unknown conditional: 0, unknown unconditional: 1869] , Statistics on independence cache: Total cache size (in pairs): 2641, Positive cache size: 2594, Positive conditional cache size: 0, Positive unconditional cache size: 2594, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, 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.1s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 185, independent conditional: 185, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 185, independent conditional: 14, independent unconditional: 171, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 185, independent conditional: 14, independent unconditional: 171, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 185, independent conditional: 14, independent unconditional: 171, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 188, independent: 167, independent conditional: 12, independent unconditional: 155, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 188, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 37, dependent conditional: 9, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 213, independent: 18, independent conditional: 2, independent unconditional: 16, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 188, unknown conditional: 14, unknown unconditional: 174] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 167, Positive conditional cache size: 12, Positive unconditional cache size: 155, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 424 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 251, independent: 226, independent conditional: 226, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 251, independent: 226, independent conditional: 32, independent unconditional: 194, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 251, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 251, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 251, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 179, Positive conditional cache size: 12, Positive unconditional cache size: 167, Negative cache size: 23, Negative conditional cache size: 2, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 438 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 193, independent: 176, independent conditional: 176, 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: 193, independent: 176, independent conditional: 43, independent unconditional: 133, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 193, independent: 176, independent conditional: 15, independent unconditional: 161, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 176, independent conditional: 15, independent unconditional: 161, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 173, independent conditional: 15, independent unconditional: 158, dependent: 15, dependent conditional: 1, dependent unconditional: 14, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 182, Positive conditional cache size: 12, Positive unconditional cache size: 170, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 488 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 184, independent: 172, independent conditional: 172, 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: 184, independent: 172, independent conditional: 31, independent unconditional: 141, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 184, independent: 172, independent conditional: 10, independent unconditional: 162, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 184, independent: 172, independent conditional: 10, independent unconditional: 162, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 184, independent: 172, independent conditional: 10, independent unconditional: 162, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 182, Positive conditional cache size: 12, Positive unconditional cache size: 170, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 175, independent conditional: 175, 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: 187, independent: 175, independent conditional: 65, independent unconditional: 110, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 175, independent conditional: 19, independent unconditional: 156, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 175, independent conditional: 19, independent unconditional: 156, dependent: 12, dependent conditional: 0, dependent unconditional: 12, 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: 175, independent conditional: 19, independent unconditional: 156, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 182, Positive conditional cache size: 12, Positive unconditional cache size: 170, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 46, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 194, independent: 181, independent conditional: 181, 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: 194, independent: 181, independent conditional: 68, independent unconditional: 113, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 194, independent: 181, independent conditional: 28, independent unconditional: 153, 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: 194, independent: 181, independent conditional: 28, independent unconditional: 153, 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: 0, 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: 194, independent: 181, independent conditional: 28, independent unconditional: 153, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 182, Positive conditional cache size: 12, Positive unconditional cache size: 170, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 64 PlacesBefore, 62 PlacesAfterwards, 79 TransitionsBefore, 74 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1010, independent: 960, independent conditional: 960, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1010, independent: 960, independent conditional: 543, independent unconditional: 417, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1010, independent: 960, independent conditional: 342, independent unconditional: 618, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1010, independent: 960, independent conditional: 342, independent unconditional: 618, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 9, independent unconditional: 7, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 1010, independent: 944, independent conditional: 333, independent unconditional: 611, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 16, unknown conditional: 9, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 334, Positive cache size: 309, Positive conditional cache size: 21, Positive unconditional cache size: 288, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 201, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 65 PlacesBefore, 65 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 802, independent: 750, independent conditional: 750, 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: 802, independent: 750, independent conditional: 325, independent unconditional: 425, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 802, independent: 750, independent conditional: 252, independent unconditional: 498, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 802, independent: 750, independent conditional: 252, independent unconditional: 498, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 1, independent unconditional: 3, 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: 802, independent: 746, independent conditional: 251, independent unconditional: 495, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 359, Positive cache size: 334, Positive conditional cache size: 23, Positive unconditional cache size: 311, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 73, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 73 PlacesBefore, 73 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 836 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 597, independent: 561, independent conditional: 561, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 597, independent: 561, independent conditional: 308, independent unconditional: 253, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 597, independent: 561, independent conditional: 245, independent unconditional: 316, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 597, independent: 561, independent conditional: 245, independent unconditional: 316, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, 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: 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: 597, independent: 559, independent conditional: 243, independent unconditional: 316, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 336, Positive conditional cache size: 25, Positive unconditional cache size: 311, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 63, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 908 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 583, independent: 544, independent conditional: 544, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 583, independent: 544, independent conditional: 292, independent unconditional: 252, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 583, independent: 544, independent conditional: 214, independent unconditional: 330, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 583, independent: 544, independent conditional: 214, independent unconditional: 330, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 583, independent: 541, independent conditional: 213, independent unconditional: 328, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 339, Positive conditional cache size: 26, Positive unconditional cache size: 313, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 78, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 81 PlacesBefore, 81 PlacesAfterwards, 114 TransitionsBefore, 114 TransitionsAfterwards, 1014 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 573, independent: 531, independent conditional: 531, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 573, independent: 531, independent conditional: 301, independent unconditional: 230, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 573, independent: 531, independent conditional: 193, independent unconditional: 338, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 573, independent: 531, independent conditional: 193, independent unconditional: 338, dependent: 42, dependent conditional: 0, dependent unconditional: 42, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 573, independent: 529, independent conditional: 193, independent unconditional: 336, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 341, Positive conditional cache size: 26, Positive unconditional cache size: 315, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 108, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 117 TransitionsBefore, 117 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 598, independent: 549, independent conditional: 549, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 598, independent: 549, independent conditional: 298, independent unconditional: 251, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 598, independent: 549, independent conditional: 210, independent unconditional: 339, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 598, independent: 549, independent conditional: 210, independent unconditional: 339, dependent: 49, dependent conditional: 0, dependent unconditional: 49, 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: 598, independent: 549, independent conditional: 210, independent unconditional: 339, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 341, Positive conditional cache size: 26, Positive unconditional cache size: 315, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 88, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 86 PlacesBefore, 86 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 537, independent: 492, independent conditional: 492, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 537, independent: 492, independent conditional: 256, independent unconditional: 236, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 537, independent: 492, independent conditional: 171, independent unconditional: 321, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 537, independent: 492, independent conditional: 171, independent unconditional: 321, dependent: 45, dependent conditional: 0, dependent unconditional: 45, 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: 537, independent: 492, independent conditional: 171, independent unconditional: 321, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 366, Positive cache size: 341, Positive conditional cache size: 26, Positive unconditional cache size: 315, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 85, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 591, independent: 545, independent conditional: 545, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 591, independent: 545, independent conditional: 247, independent unconditional: 298, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 591, independent: 545, independent conditional: 142, independent unconditional: 403, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 591, independent: 545, independent conditional: 142, independent unconditional: 403, dependent: 46, dependent conditional: 0, dependent unconditional: 46, 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: 591, independent: 543, independent conditional: 142, independent unconditional: 401, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 368, Positive cache size: 343, Positive conditional cache size: 26, Positive unconditional cache size: 317, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 105, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 662, independent: 615, independent conditional: 615, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 662, independent: 615, independent conditional: 279, independent unconditional: 336, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 662, independent: 615, independent conditional: 164, independent unconditional: 451, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 662, independent: 615, independent conditional: 164, independent unconditional: 451, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 662, independent: 614, independent conditional: 164, independent unconditional: 450, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 344, Positive conditional cache size: 26, Positive unconditional cache size: 318, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 115, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 87 PlacesBefore, 87 PlacesAfterwards, 106 TransitionsBefore, 106 TransitionsAfterwards, 928 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 570, independent: 523, independent conditional: 523, independent unconditional: 0, dependent: 47, dependent conditional: 47, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 570, independent: 523, independent conditional: 236, independent unconditional: 287, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 570, independent: 523, independent conditional: 138, independent unconditional: 385, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 570, independent: 523, independent conditional: 138, independent unconditional: 385, dependent: 47, dependent conditional: 0, dependent unconditional: 47, 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: 570, independent: 523, independent conditional: 138, independent unconditional: 385, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 369, Positive cache size: 344, Positive conditional cache size: 26, Positive unconditional cache size: 318, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 98, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 94 PlacesBefore, 94 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 1068 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1436, independent: 1322, independent conditional: 1322, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1436, independent: 1322, independent conditional: 700, independent unconditional: 622, dependent: 114, dependent conditional: 8, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1436, independent: 1322, independent conditional: 316, independent unconditional: 1006, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1436, independent: 1322, independent conditional: 316, independent unconditional: 1006, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, 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: 1436, independent: 1320, independent conditional: 315, independent unconditional: 1005, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 413, Positive cache size: 388, Positive conditional cache size: 29, Positive unconditional cache size: 359, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 392, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 98 PlacesBefore, 99 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 1080 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1366, independent: 1249, independent conditional: 1249, independent unconditional: 0, dependent: 117, dependent conditional: 117, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1366, independent: 1249, independent conditional: 642, independent unconditional: 607, dependent: 117, dependent conditional: 1, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1366, independent: 1249, independent conditional: 295, independent unconditional: 954, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1366, independent: 1249, independent conditional: 295, independent unconditional: 954, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 5, independent unconditional: 1, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 1366, independent: 1243, independent conditional: 290, independent unconditional: 953, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 396, Positive conditional cache size: 34, Positive unconditional cache size: 362, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 348, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 96 PlacesBefore, 96 PlacesAfterwards, 127 TransitionsBefore, 127 TransitionsAfterwards, 1070 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1324, independent: 1204, independent conditional: 1204, independent unconditional: 0, dependent: 120, dependent conditional: 120, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1324, independent: 1204, independent conditional: 548, independent unconditional: 656, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1324, independent: 1204, independent conditional: 206, independent unconditional: 998, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1324, independent: 1204, independent conditional: 206, independent unconditional: 998, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 1324, independent: 1199, independent conditional: 201, independent unconditional: 998, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 448, Positive cache size: 423, Positive conditional cache size: 39, Positive unconditional cache size: 384, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 342, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 100 PlacesBefore, 99 PlacesAfterwards, 127 TransitionsBefore, 126 TransitionsAfterwards, 1376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 508, independent: 500, independent conditional: 500, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 508, independent: 500, independent conditional: 420, independent unconditional: 80, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 508, independent: 500, independent conditional: 292, independent unconditional: 208, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 508, independent: 500, independent conditional: 292, independent unconditional: 208, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 20, independent unconditional: 1, 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: 21, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 508, independent: 479, independent conditional: 272, independent unconditional: 207, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 21, unknown conditional: 20, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 478, Positive conditional cache size: 63, Positive unconditional cache size: 415, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 128, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 94 PlacesBefore, 94 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 120, independent conditional: 120, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 120, independent conditional: 84, independent unconditional: 36, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 120, independent conditional: 56, independent unconditional: 64, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 120, independent conditional: 56, independent unconditional: 64, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 124, independent: 120, independent conditional: 56, independent unconditional: 64, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 478, Positive conditional cache size: 63, Positive unconditional cache size: 415, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 98 PlacesBefore, 98 PlacesAfterwards, 105 TransitionsBefore, 104 TransitionsAfterwards, 1524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, independent: 229, independent conditional: 229, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 237, independent: 229, independent conditional: 160, independent unconditional: 69, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, independent: 229, independent conditional: 104, independent unconditional: 125, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, independent: 229, independent conditional: 104, independent unconditional: 125, dependent: 8, dependent conditional: 0, dependent unconditional: 8, 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: 237, independent: 229, independent conditional: 104, independent unconditional: 125, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 478, Positive conditional cache size: 63, Positive unconditional cache size: 415, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, 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, 102 PlacesBefore, 102 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 1584 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 112, independent conditional: 112, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 112, independent conditional: 80, independent unconditional: 32, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 112, independent conditional: 52, independent unconditional: 60, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 112, independent conditional: 52, independent unconditional: 60, dependent: 4, dependent conditional: 0, dependent unconditional: 4, 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: 116, independent: 112, independent conditional: 52, independent unconditional: 60, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 478, Positive conditional cache size: 63, Positive unconditional cache size: 415, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 107 PlacesBefore, 102 PlacesAfterwards, 89 TransitionsBefore, 79 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 233, independent: 226, independent conditional: 226, 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: 233, independent: 226, independent conditional: 223, independent unconditional: 3, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 233, independent: 226, independent conditional: 198, independent unconditional: 28, 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: 233, independent: 226, independent conditional: 198, independent unconditional: 28, 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: 51, independent: 51, independent conditional: 48, independent unconditional: 3, 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: 51, independent: 51, independent conditional: 0, independent unconditional: 51, 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: 233, independent: 175, independent conditional: 150, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 51, unknown conditional: 48, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 629, Positive cache size: 604, Positive conditional cache size: 119, Positive unconditional cache size: 485, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 81 PlacesBefore, 76 PlacesAfterwards, 53 TransitionsBefore, 49 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 40, independent conditional: 40, 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: 40, independent: 40, independent conditional: 24, independent unconditional: 16, 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: 40, independent: 40, independent conditional: 21, independent unconditional: 19, 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: 40, independent: 40, independent conditional: 21, independent unconditional: 19, 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: 2, independent: 2, independent conditional: 2, 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: 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: 40, independent: 38, independent conditional: 19, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 778, Positive cache size: 753, Positive conditional cache size: 130, Positive unconditional cache size: 623, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 176 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): 778, Positive cache size: 753, Positive conditional cache size: 130, Positive unconditional cache size: 623, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=-4, t577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=-3, t577={5:0}, t578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=-2, t577={5:0}, t578={6:0}, t579={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=-1, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 __unbuffered_p3_EAX = z [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 a = 1 [L753] 1 x = 1 [L765] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = 1 [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 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: 78.0s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 46.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1180 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1180 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 286 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3096 IncrementalHoareTripleChecker+Invalid, 3382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 286 mSolverCounterUnsat, 41 mSDtfsCounter, 3096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1716occurred in iteration=19, InterpolantAutomatonStates: 139, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 5104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2022-12-06 04:11:13,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...