/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:37:11,414 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:37:11,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:37:11,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:37:11,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:37:11,441 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:37:11,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:37:11,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:37:11,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:37:11,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:37:11,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:37:11,456 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:37:11,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:37:11,456 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:37:11,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:37:11,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:37:11,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:37:11,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:37:11,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:37:11,460 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:37:11,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:37:11,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:37:11,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:37:11,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:37:11,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:37:11,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:37:11,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:37:11,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:37:11,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:37:11,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:37:11,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:37:11,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:37:11,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:37:11,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:37:11,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:37:11,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:37:11,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:37:11,476 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:37:11,476 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:37:11,477 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:37:11,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:37:11,478 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 00:37:11,494 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:37:11,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:37:11,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:37:11,495 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:37:11,496 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:37:11,496 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:37:11,496 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:37:11,496 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:37:11,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:37:11,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:37:11,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:37:11,498 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:37:11,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:37:11,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:37:11,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:37:11,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:37:11,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:37:11,506 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:37:11,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:37:11,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:37:11,507 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-13 00:37:11,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:37:11,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:37:11,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:37:11,783 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:37:11,783 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:37:11,784 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2022-12-13 00:37:12,760 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:37:12,948 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:37:12,949 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_tso.oepc.i [2022-12-13 00:37:12,959 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b6ce2c7/7a1d5c19a1344f8dbd803c7b2b605140/FLAGc3f02189e [2022-12-13 00:37:12,970 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82b6ce2c7/7a1d5c19a1344f8dbd803c7b2b605140 [2022-12-13 00:37:12,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:37:12,973 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:37:12,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:37:12,973 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:37:12,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:37:12,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:12" (1/1) ... [2022-12-13 00:37:12,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a888f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:12, skipping insertion in model container [2022-12-13 00:37:12,976 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:37:12" (1/1) ... [2022-12-13 00:37:12,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:37:13,006 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:37:13,103 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/mix019_tso.oepc.i[949,962] [2022-12-13 00:37:13,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:37:13,314 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:37:13,324 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/mix019_tso.oepc.i[949,962] [2022-12-13 00:37:13,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,357 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,363 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,372 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:37:13,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:37:13,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:37:13,411 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:37:13,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13 WrapperNode [2022-12-13 00:37:13,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:37:13,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:37:13,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:37:13,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:37:13,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,443 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,461 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 00:37:13,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:37:13,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:37:13,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:37:13,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:37:13,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,494 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:37:13,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:37:13,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:37:13,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:37:13,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (1/1) ... [2022-12-13 00:37:13,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:37:13,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:37:13,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 00:37:13,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 00:37:13,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:37:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:37:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:37:13,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:37:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:37:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:37:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:37:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:37:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:37:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:37:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:37:13,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:37:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:37:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:37:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:37:13,601 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 00:37:13,772 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:37:13,774 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:37:14,055 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:37:14,258 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:37:14,259 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:37:14,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:14 BoogieIcfgContainer [2022-12-13 00:37:14,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:37:14,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:37:14,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:37:14,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:37:14,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:37:12" (1/3) ... [2022-12-13 00:37:14,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fcde8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:14, skipping insertion in model container [2022-12-13 00:37:14,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:37:13" (2/3) ... [2022-12-13 00:37:14,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fcde8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:37:14, skipping insertion in model container [2022-12-13 00:37:14,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:37:14" (3/3) ... [2022-12-13 00:37:14,266 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2022-12-13 00:37:14,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:37:14,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:37:14,289 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:37:14,361 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:37:14,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 00:37:14,429 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 00:37:14,429 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:14,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 00:37:14,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 00:37:14,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-13 00:37:14,442 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:14,458 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 00:37:14,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-13 00:37:14,486 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 00:37:14,486 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:14,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 00:37:14,489 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 00:37:14,489 INFO L226 LiptonReduction]: Number of co-enabled transitions 1994 [2022-12-13 00:37:22,116 INFO L241 LiptonReduction]: Total number of compositions: 86 [2022-12-13 00:37:22,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:37:22,131 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;@276dd2a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:37:22,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:37:22,134 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 00:37:22,135 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:22,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:22,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 00:37:22,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:22,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:22,139 INFO L85 PathProgramCache]: Analyzing trace with hash 483742250, now seen corresponding path program 1 times [2022-12-13 00:37:22,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:22,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300174417] [2022-12-13 00:37:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:22,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:22,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-13 00:37:22,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:22,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300174417] [2022-12-13 00:37:22,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300174417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:22,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:22,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:37:22,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427654632] [2022-12-13 00:37:22,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:22,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:37:22,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:22,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:37:22,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:37:22,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 62 [2022-12-13 00:37:22,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-13 00:37:22,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:22,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 62 [2022-12-13 00:37:22,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:23,965 INFO L130 PetriNetUnfolder]: 7924/12849 cut-off events. [2022-12-13 00:37:23,966 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 00:37:23,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24251 conditions, 12849 events. 7924/12849 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 98494 event pairs, 1048 based on Foata normal form. 0/7896 useless extension candidates. Maximal degree in co-relation 24240. Up to 9597 conditions per place. [2022-12-13 00:37:23,999 INFO L137 encePairwiseOnDemand]: 57/62 looper letters, 32 selfloop transitions, 2 changer transitions 52/98 dead transitions. [2022-12-13 00:37:23,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 380 flow [2022-12-13 00:37:24,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:37:24,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:37:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-12-13 00:37:24,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6827956989247311 [2022-12-13 00:37:24,008 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 3 states and 127 transitions. [2022-12-13 00:37:24,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 380 flow [2022-12-13 00:37:24,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 98 transitions, 376 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:37:24,013 INFO L231 Difference]: Finished difference. Result has 68 places, 33 transitions, 76 flow [2022-12-13 00:37:24,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=68, PETRI_TRANSITIONS=33} [2022-12-13 00:37:24,016 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2022-12-13 00:37:24,016 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:24,017 INFO L89 Accepts]: Start accepts. Operand has 68 places, 33 transitions, 76 flow [2022-12-13 00:37:24,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:24,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:24,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 33 transitions, 76 flow [2022-12-13 00:37:24,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 00:37:24,024 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 00:37:24,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:24,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 74 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:37:24,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 00:37:24,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-13 00:37:24,085 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:24,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 00:37:24,086 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 00:37:24,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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-13 00:37:24,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:24,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:24,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:37:24,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash 868175786, now seen corresponding path program 1 times [2022-12-13 00:37:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:24,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673654034] [2022-12-13 00:37:24,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:24,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673654034] [2022-12-13 00:37:24,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673654034] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:24,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:24,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:37:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894751775] [2022-12-13 00:37:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:24,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:24,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:24,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:24,498 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:37:24,498 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 00:37:24,498 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:24,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:37:24,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:24,819 INFO L130 PetriNetUnfolder]: 2231/3424 cut-off events. [2022-12-13 00:37:24,819 INFO L131 PetriNetUnfolder]: For 165/165 co-relation queries the response was YES. [2022-12-13 00:37:24,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 3424 events. 2231/3424 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 16411 event pairs, 671 based on Foata normal form. 72/3014 useless extension candidates. Maximal degree in co-relation 6924. Up to 2425 conditions per place. [2022-12-13 00:37:24,837 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 35 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-12-13 00:37:24,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 176 flow [2022-12-13 00:37:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:37:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:37:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-12-13 00:37:24,838 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2022-12-13 00:37:24,838 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 62 transitions. [2022-12-13 00:37:24,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 176 flow [2022-12-13 00:37:24,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:24,840 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 80 flow [2022-12-13 00:37:24,840 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2022-12-13 00:37:24,841 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -28 predicate places. [2022-12-13 00:37:24,841 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:24,841 INFO L89 Accepts]: Start accepts. Operand has 43 places, 33 transitions, 80 flow [2022-12-13 00:37:24,841 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:24,841 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:24,842 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 80 flow [2022-12-13 00:37:24,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 80 flow [2022-12-13 00:37:24,845 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 00:37:24,845 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:37:24,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 78 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 00:37:24,846 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 80 flow [2022-12-13 00:37:24,846 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 00:37:24,886 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:24,887 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 00:37:24,887 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 78 flow [2022-12-13 00:37:24,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 00:37:24,887 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:24,887 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:24,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:37:24,888 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1143740014, now seen corresponding path program 1 times [2022-12-13 00:37:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:24,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517847442] [2022-12-13 00:37:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:24,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:25,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:25,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517847442] [2022-12-13 00:37:25,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517847442] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:25,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:25,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:37:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183599209] [2022-12-13 00:37:25,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:25,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:25,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:25,162 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:37:25,162 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:25,162 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:25,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:37:25,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:25,342 INFO L130 PetriNetUnfolder]: 1318/2136 cut-off events. [2022-12-13 00:37:25,342 INFO L131 PetriNetUnfolder]: For 178/178 co-relation queries the response was YES. [2022-12-13 00:37:25,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4460 conditions, 2136 events. 1318/2136 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10950 event pairs, 804 based on Foata normal form. 8/1791 useless extension candidates. Maximal degree in co-relation 4449. Up to 1881 conditions per place. [2022-12-13 00:37:25,363 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 35 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2022-12-13 00:37:25,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 212 flow [2022-12-13 00:37:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 00:37:25,364 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2022-12-13 00:37:25,364 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 78 flow. Second operand 4 states and 83 transitions. [2022-12-13 00:37:25,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 212 flow [2022-12-13 00:37:25,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 52 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:25,366 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 119 flow [2022-12-13 00:37:25,366 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 00:37:25,367 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2022-12-13 00:37:25,367 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:25,367 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 119 flow [2022-12-13 00:37:25,367 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:25,367 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:25,368 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 119 flow [2022-12-13 00:37:25,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 119 flow [2022-12-13 00:37:25,374 INFO L130 PetriNetUnfolder]: 8/85 cut-off events. [2022-12-13 00:37:25,374 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 00:37:25,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 85 events. 8/85 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 120. Up to 13 conditions per place. [2022-12-13 00:37:25,375 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 119 flow [2022-12-13 00:37:25,375 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 00:37:25,435 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:25,436 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 69 [2022-12-13 00:37:25,436 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 119 flow [2022-12-13 00:37:25,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:25,437 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:25,437 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:25,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:37:25,437 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:25,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1096231142, now seen corresponding path program 1 times [2022-12-13 00:37:25,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:25,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966429550] [2022-12-13 00:37:25,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:25,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:25,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966429550] [2022-12-13 00:37:25,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966429550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:25,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:25,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:25,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991518159] [2022-12-13 00:37:25,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:25,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:25,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:25,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:25,716 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:37:25,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:25,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:25,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:37:25,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:26,022 INFO L130 PetriNetUnfolder]: 1326/2152 cut-off events. [2022-12-13 00:37:26,022 INFO L131 PetriNetUnfolder]: For 700/726 co-relation queries the response was YES. [2022-12-13 00:37:26,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5068 conditions, 2152 events. 1326/2152 cut-off events. For 700/726 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11044 event pairs, 766 based on Foata normal form. 14/1815 useless extension candidates. Maximal degree in co-relation 5055. Up to 1894 conditions per place. [2022-12-13 00:37:26,039 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 37 selfloop transitions, 14 changer transitions 0/61 dead transitions. [2022-12-13 00:37:26,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 61 transitions, 292 flow [2022-12-13 00:37:26,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:26,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2022-12-13 00:37:26,041 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61875 [2022-12-13 00:37:26,041 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 119 flow. Second operand 5 states and 99 transitions. [2022-12-13 00:37:26,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 61 transitions, 292 flow [2022-12-13 00:37:26,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 292 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 00:37:26,044 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 207 flow [2022-12-13 00:37:26,044 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2022-12-13 00:37:26,044 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2022-12-13 00:37:26,045 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:26,045 INFO L89 Accepts]: Start accepts. Operand has 51 places, 47 transitions, 207 flow [2022-12-13 00:37:26,045 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:26,045 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:26,046 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 47 transitions, 207 flow [2022-12-13 00:37:26,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 47 transitions, 207 flow [2022-12-13 00:37:26,058 INFO L130 PetriNetUnfolder]: 23/120 cut-off events. [2022-12-13 00:37:26,059 INFO L131 PetriNetUnfolder]: For 60/71 co-relation queries the response was YES. [2022-12-13 00:37:26,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 120 events. 23/120 cut-off events. For 60/71 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 565 event pairs, 3 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 247. Up to 34 conditions per place. [2022-12-13 00:37:26,060 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 47 transitions, 207 flow [2022-12-13 00:37:26,060 INFO L226 LiptonReduction]: Number of co-enabled transitions 748 [2022-12-13 00:37:26,087 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:26,087 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 00:37:26,088 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 207 flow [2022-12-13 00:37:26,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:26,088 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:26,088 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:26,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:37:26,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1096201382, now seen corresponding path program 2 times [2022-12-13 00:37:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:26,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668901767] [2022-12-13 00:37:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:26,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:26,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:26,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:26,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668901767] [2022-12-13 00:37:26,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668901767] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:26,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:26,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484396711] [2022-12-13 00:37:26,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:26,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:26,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:26,506 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:37:26,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:26,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:26,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:37:26,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:26,787 INFO L130 PetriNetUnfolder]: 1362/2222 cut-off events. [2022-12-13 00:37:26,787 INFO L131 PetriNetUnfolder]: For 1830/1884 co-relation queries the response was YES. [2022-12-13 00:37:26,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 2222 events. 1362/2222 cut-off events. For 1830/1884 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11549 event pairs, 785 based on Foata normal form. 27/1892 useless extension candidates. Maximal degree in co-relation 5904. Up to 1862 conditions per place. [2022-12-13 00:37:26,799 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 15 changer transitions 0/69 dead transitions. [2022-12-13 00:37:26,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 400 flow [2022-12-13 00:37:26,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 00:37:26,801 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 00:37:26,801 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 207 flow. Second operand 4 states and 87 transitions. [2022-12-13 00:37:26,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 400 flow [2022-12-13 00:37:26,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 385 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 00:37:26,806 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 267 flow [2022-12-13 00:37:26,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2022-12-13 00:37:26,807 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -17 predicate places. [2022-12-13 00:37:26,807 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:26,807 INFO L89 Accepts]: Start accepts. Operand has 54 places, 51 transitions, 267 flow [2022-12-13 00:37:26,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:26,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:26,808 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 51 transitions, 267 flow [2022-12-13 00:37:26,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 51 transitions, 267 flow [2022-12-13 00:37:26,820 INFO L130 PetriNetUnfolder]: 44/145 cut-off events. [2022-12-13 00:37:26,820 INFO L131 PetriNetUnfolder]: For 171/191 co-relation queries the response was YES. [2022-12-13 00:37:26,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 145 events. 44/145 cut-off events. For 171/191 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 670 event pairs, 12 based on Foata normal form. 2/113 useless extension candidates. Maximal degree in co-relation 394. Up to 65 conditions per place. [2022-12-13 00:37:26,822 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 51 transitions, 267 flow [2022-12-13 00:37:26,822 INFO L226 LiptonReduction]: Number of co-enabled transitions 792 [2022-12-13 00:37:26,833 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:26,834 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-13 00:37:26,834 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 267 flow [2022-12-13 00:37:26,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:26,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:26,834 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:26,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:37:26,835 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash -661156673, now seen corresponding path program 1 times [2022-12-13 00:37:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:26,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918917624] [2022-12-13 00:37:26,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:26,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:27,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:27,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918917624] [2022-12-13 00:37:27,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918917624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:27,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:27,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074828286] [2022-12-13 00:37:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:27,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:27,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:27,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:27,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:27,138 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:37:27,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:27,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:27,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:37:27,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:27,431 INFO L130 PetriNetUnfolder]: 1322/2158 cut-off events. [2022-12-13 00:37:27,432 INFO L131 PetriNetUnfolder]: For 3247/3299 co-relation queries the response was YES. [2022-12-13 00:37:27,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6419 conditions, 2158 events. 1322/2158 cut-off events. For 3247/3299 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11370 event pairs, 325 based on Foata normal form. 41/1850 useless extension candidates. Maximal degree in co-relation 6400. Up to 1709 conditions per place. [2022-12-13 00:37:27,445 INFO L137 encePairwiseOnDemand]: 28/32 looper letters, 55 selfloop transitions, 8 changer transitions 0/73 dead transitions. [2022-12-13 00:37:27,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 466 flow [2022-12-13 00:37:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:27,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-12-13 00:37:27,448 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6796875 [2022-12-13 00:37:27,448 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 267 flow. Second operand 4 states and 87 transitions. [2022-12-13 00:37:27,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 466 flow [2022-12-13 00:37:27,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 435 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:27,457 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 262 flow [2022-12-13 00:37:27,457 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2022-12-13 00:37:27,459 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -15 predicate places. [2022-12-13 00:37:27,459 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:27,459 INFO L89 Accepts]: Start accepts. Operand has 56 places, 51 transitions, 262 flow [2022-12-13 00:37:27,460 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:27,460 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:27,460 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 51 transitions, 262 flow [2022-12-13 00:37:27,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 51 transitions, 262 flow [2022-12-13 00:37:27,475 INFO L130 PetriNetUnfolder]: 43/142 cut-off events. [2022-12-13 00:37:27,476 INFO L131 PetriNetUnfolder]: For 186/199 co-relation queries the response was YES. [2022-12-13 00:37:27,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 142 events. 43/142 cut-off events. For 186/199 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 639 event pairs, 11 based on Foata normal form. 2/110 useless extension candidates. Maximal degree in co-relation 373. Up to 62 conditions per place. [2022-12-13 00:37:27,478 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 51 transitions, 262 flow [2022-12-13 00:37:27,478 INFO L226 LiptonReduction]: Number of co-enabled transitions 788 [2022-12-13 00:37:27,481 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:27,482 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-13 00:37:27,482 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 262 flow [2022-12-13 00:37:27,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:27,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:27,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:27,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:37:27,483 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:27,483 INFO L85 PathProgramCache]: Analyzing trace with hash 978978933, now seen corresponding path program 1 times [2022-12-13 00:37:27,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:27,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987369988] [2022-12-13 00:37:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:27,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:27,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987369988] [2022-12-13 00:37:27,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987369988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:27,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:27,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413029818] [2022-12-13 00:37:27,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:27,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:27,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:27,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:27,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:27,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 00:37:27,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:27,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:27,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 00:37:27,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:28,180 INFO L130 PetriNetUnfolder]: 1384/2321 cut-off events. [2022-12-13 00:37:28,180 INFO L131 PetriNetUnfolder]: For 3248/3289 co-relation queries the response was YES. [2022-12-13 00:37:28,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6798 conditions, 2321 events. 1384/2321 cut-off events. For 3248/3289 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12764 event pairs, 298 based on Foata normal form. 29/1995 useless extension candidates. Maximal degree in co-relation 6778. Up to 1743 conditions per place. [2022-12-13 00:37:28,191 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 61 selfloop transitions, 15 changer transitions 0/86 dead transitions. [2022-12-13 00:37:28,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 86 transitions, 537 flow [2022-12-13 00:37:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-13 00:37:28,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.675 [2022-12-13 00:37:28,193 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 262 flow. Second operand 5 states and 108 transitions. [2022-12-13 00:37:28,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 86 transitions, 537 flow [2022-12-13 00:37:28,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 86 transitions, 520 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:28,196 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 339 flow [2022-12-13 00:37:28,196 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2022-12-13 00:37:28,196 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2022-12-13 00:37:28,197 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:28,197 INFO L89 Accepts]: Start accepts. Operand has 60 places, 58 transitions, 339 flow [2022-12-13 00:37:28,197 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:28,197 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:28,197 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 58 transitions, 339 flow [2022-12-13 00:37:28,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 58 transitions, 339 flow [2022-12-13 00:37:28,215 INFO L130 PetriNetUnfolder]: 76/222 cut-off events. [2022-12-13 00:37:28,216 INFO L131 PetriNetUnfolder]: For 426/496 co-relation queries the response was YES. [2022-12-13 00:37:28,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 222 events. 76/222 cut-off events. For 426/496 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1135 event pairs, 18 based on Foata normal form. 4/171 useless extension candidates. Maximal degree in co-relation 680. Up to 90 conditions per place. [2022-12-13 00:37:28,218 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 58 transitions, 339 flow [2022-12-13 00:37:28,218 INFO L226 LiptonReduction]: Number of co-enabled transitions 900 [2022-12-13 00:37:28,224 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] $Ultimate##0-->L775: Formula: (and (= 2 v_~x$w_buff0~0_145) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17|) (= v_~x$r_buff0_thd2~0_76 1) (= v_~x$r_buff0_thd0~0_140 v_~x$r_buff1_thd0~0_139) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_231 256) 0)) (not (= (mod v_~x$w_buff0_used~0_260 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_260 1) (= v_~x$w_buff0~0_146 v_~x$w_buff1~0_126) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$w_buff0_used~0_261 v_~x$w_buff1_used~0_231) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17| 0)) (= v_~x$r_buff1_thd3~0_53 v_~x$r_buff0_thd3~0_59) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_77) (= v_~x$r_buff1_thd1~0_60 v_~x$r_buff0_thd1~0_65)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_146, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_261, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_145, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_126, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_231, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_60, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_260, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [330] L749-->L756: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_24 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_110 256) 0)))) (.cse1 (and .cse5 .cse3)) (.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_97 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_110) v_~x$w_buff0_used~0_109) (= v_~x$r_buff0_thd1~0_23 (ite .cse1 0 v_~x$r_buff0_thd1~0_24)) (= v_~x~0_63 (ite .cse0 v_~x$w_buff0~0_41 (ite .cse2 v_~x$w_buff1~0_40 v_~x~0_64))) (= v_~x$w_buff1_used~0_96 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_97)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$r_buff0_thd1~0_23 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_96 256) 0)))) 0 v_~x$r_buff1_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_24, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_97, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_64, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_41, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_23, ~x$w_buff1~0=v_~x$w_buff1~0_40, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_96, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_63, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:37:28,387 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:28,388 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 191 [2022-12-13 00:37:28,388 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 345 flow [2022-12-13 00:37:28,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:28,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:28,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:28,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:37:28,389 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:28,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash 979008693, now seen corresponding path program 2 times [2022-12-13 00:37:28,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:28,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722252521] [2022-12-13 00:37:28,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:28,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:28,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:28,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722252521] [2022-12-13 00:37:28,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722252521] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:28,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:28,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528548030] [2022-12-13 00:37:28,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:28,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:28,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:28,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:28,683 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 00:37:28,684 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:28,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:28,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 00:37:28,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:29,048 INFO L130 PetriNetUnfolder]: 1411/2292 cut-off events. [2022-12-13 00:37:29,048 INFO L131 PetriNetUnfolder]: For 4907/4963 co-relation queries the response was YES. [2022-12-13 00:37:29,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7791 conditions, 2292 events. 1411/2292 cut-off events. For 4907/4963 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12147 event pairs, 616 based on Foata normal form. 35/1969 useless extension candidates. Maximal degree in co-relation 7769. Up to 1768 conditions per place. [2022-12-13 00:37:29,066 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 20 changer transitions 0/95 dead transitions. [2022-12-13 00:37:29,067 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 95 transitions, 692 flow [2022-12-13 00:37:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-13 00:37:29,068 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:37:29,068 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 345 flow. Second operand 5 states and 110 transitions. [2022-12-13 00:37:29,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 95 transitions, 692 flow [2022-12-13 00:37:29,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 95 transitions, 652 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-13 00:37:29,074 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 466 flow [2022-12-13 00:37:29,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=466, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2022-12-13 00:37:29,077 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -6 predicate places. [2022-12-13 00:37:29,077 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:29,077 INFO L89 Accepts]: Start accepts. Operand has 65 places, 68 transitions, 466 flow [2022-12-13 00:37:29,078 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:29,078 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:29,078 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 68 transitions, 466 flow [2022-12-13 00:37:29,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 68 transitions, 466 flow [2022-12-13 00:37:29,105 INFO L130 PetriNetUnfolder]: 88/248 cut-off events. [2022-12-13 00:37:29,105 INFO L131 PetriNetUnfolder]: For 759/867 co-relation queries the response was YES. [2022-12-13 00:37:29,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 248 events. 88/248 cut-off events. For 759/867 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1303 event pairs, 10 based on Foata normal form. 8/198 useless extension candidates. Maximal degree in co-relation 876. Up to 97 conditions per place. [2022-12-13 00:37:29,108 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 68 transitions, 466 flow [2022-12-13 00:37:29,108 INFO L226 LiptonReduction]: Number of co-enabled transitions 990 [2022-12-13 00:37:29,110 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:29,112 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-13 00:37:29,112 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 466 flow [2022-12-13 00:37:29,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:29,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:29,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:29,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:37:29,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:29,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:29,114 INFO L85 PathProgramCache]: Analyzing trace with hash 979075002, now seen corresponding path program 1 times [2022-12-13 00:37:29,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:29,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336412423] [2022-12-13 00:37:29,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:29,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:29,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:29,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:29,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336412423] [2022-12-13 00:37:29,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336412423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:29,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:29,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:29,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493031049] [2022-12-13 00:37:29,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:29,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:29,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:29,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:29,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:29,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2022-12-13 00:37:29,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 466 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:29,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:29,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2022-12-13 00:37:29,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:29,868 INFO L130 PetriNetUnfolder]: 1517/2491 cut-off events. [2022-12-13 00:37:29,868 INFO L131 PetriNetUnfolder]: For 8538/8609 co-relation queries the response was YES. [2022-12-13 00:37:29,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9117 conditions, 2491 events. 1517/2491 cut-off events. For 8538/8609 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13762 event pairs, 359 based on Foata normal form. 49/2156 useless extension candidates. Maximal degree in co-relation 9092. Up to 1811 conditions per place. [2022-12-13 00:37:29,883 INFO L137 encePairwiseOnDemand]: 24/33 looper letters, 68 selfloop transitions, 22 changer transitions 0/100 dead transitions. [2022-12-13 00:37:29,883 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 778 flow [2022-12-13 00:37:29,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:29,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:29,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 00:37:29,884 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6787878787878788 [2022-12-13 00:37:29,884 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 466 flow. Second operand 5 states and 112 transitions. [2022-12-13 00:37:29,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 778 flow [2022-12-13 00:37:29,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 100 transitions, 739 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 00:37:29,893 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 510 flow [2022-12-13 00:37:29,894 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=510, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2022-12-13 00:37:29,894 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -2 predicate places. [2022-12-13 00:37:29,894 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:29,894 INFO L89 Accepts]: Start accepts. Operand has 69 places, 70 transitions, 510 flow [2022-12-13 00:37:29,895 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:29,895 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:29,895 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 70 transitions, 510 flow [2022-12-13 00:37:29,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 70 transitions, 510 flow [2022-12-13 00:37:29,918 INFO L130 PetriNetUnfolder]: 95/256 cut-off events. [2022-12-13 00:37:29,918 INFO L131 PetriNetUnfolder]: For 1007/1081 co-relation queries the response was YES. [2022-12-13 00:37:29,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 256 events. 95/256 cut-off events. For 1007/1081 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1364 event pairs, 9 based on Foata normal form. 8/212 useless extension candidates. Maximal degree in co-relation 998. Up to 102 conditions per place. [2022-12-13 00:37:29,921 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 70 transitions, 510 flow [2022-12-13 00:37:29,921 INFO L226 LiptonReduction]: Number of co-enabled transitions 1030 [2022-12-13 00:37:29,923 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:29,924 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 00:37:29,924 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 510 flow [2022-12-13 00:37:29,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:29,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:29,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:29,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:37:29,925 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:29,925 INFO L85 PathProgramCache]: Analyzing trace with hash 828632622, now seen corresponding path program 2 times [2022-12-13 00:37:29,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:29,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887531022] [2022-12-13 00:37:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:29,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:30,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887531022] [2022-12-13 00:37:30,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887531022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:30,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:30,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:30,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276490469] [2022-12-13 00:37:30,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:30,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:30,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:30,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:30,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:30,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 00:37:30,542 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 510 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:30,542 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:30,542 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 00:37:30,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:31,036 INFO L130 PetriNetUnfolder]: 2607/4020 cut-off events. [2022-12-13 00:37:31,036 INFO L131 PetriNetUnfolder]: For 14471/14471 co-relation queries the response was YES. [2022-12-13 00:37:31,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14612 conditions, 4020 events. 2607/4020 cut-off events. For 14471/14471 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21300 event pairs, 541 based on Foata normal form. 18/3474 useless extension candidates. Maximal degree in co-relation 14585. Up to 3169 conditions per place. [2022-12-13 00:37:31,058 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 86 selfloop transitions, 28 changer transitions 0/122 dead transitions. [2022-12-13 00:37:31,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 1022 flow [2022-12-13 00:37:31,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-13 00:37:31,059 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2022-12-13 00:37:31,060 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 510 flow. Second operand 6 states and 120 transitions. [2022-12-13 00:37:31,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 1022 flow [2022-12-13 00:37:31,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 122 transitions, 961 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 00:37:31,074 INFO L231 Difference]: Finished difference. Result has 73 places, 86 transitions, 704 flow [2022-12-13 00:37:31,075 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=73, PETRI_TRANSITIONS=86} [2022-12-13 00:37:31,075 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2022-12-13 00:37:31,075 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:31,075 INFO L89 Accepts]: Start accepts. Operand has 73 places, 86 transitions, 704 flow [2022-12-13 00:37:31,077 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:31,077 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:31,077 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 86 transitions, 704 flow [2022-12-13 00:37:31,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 86 transitions, 704 flow [2022-12-13 00:37:31,125 INFO L130 PetriNetUnfolder]: 283/617 cut-off events. [2022-12-13 00:37:31,125 INFO L131 PetriNetUnfolder]: For 2601/2667 co-relation queries the response was YES. [2022-12-13 00:37:31,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2468 conditions, 617 events. 283/617 cut-off events. For 2601/2667 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3758 event pairs, 49 based on Foata normal form. 13/524 useless extension candidates. Maximal degree in co-relation 2442. Up to 329 conditions per place. [2022-12-13 00:37:31,131 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 86 transitions, 704 flow [2022-12-13 00:37:31,131 INFO L226 LiptonReduction]: Number of co-enabled transitions 1116 [2022-12-13 00:37:31,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] $Ultimate##0-->L775: Formula: (and (= 2 v_~x$w_buff0~0_145) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17|) (= v_~x$r_buff0_thd2~0_76 1) (= v_~x$r_buff0_thd0~0_140 v_~x$r_buff1_thd0~0_139) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_231 256) 0)) (not (= (mod v_~x$w_buff0_used~0_260 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_260 1) (= v_~x$w_buff0~0_146 v_~x$w_buff1~0_126) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$w_buff0_used~0_261 v_~x$w_buff1_used~0_231) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17| 0)) (= v_~x$r_buff1_thd3~0_53 v_~x$r_buff0_thd3~0_59) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_77) (= v_~x$r_buff1_thd1~0_60 v_~x$r_buff0_thd1~0_65)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_146, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_261, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_145, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_126, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_231, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_60, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_260, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [346] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_91 256) 0))) (.cse4 (not (= 0 (mod v_~x$r_buff1_thd3~0_20 256)))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_92 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_79 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5))) (and (= v_~x$w_buff0_used~0_91 (ite .cse0 0 v_~x$w_buff0_used~0_92)) (= v_~x$w_buff1_used~0_78 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_79)) (= v_~x~0_45 (ite .cse0 v_~x$w_buff0~0_31 (ite .cse2 v_~x$w_buff1~0_28 v_~x~0_46))) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$r_buff1_thd3~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_78 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_79, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_46, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_92} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$w_buff1~0=v_~x$w_buff1~0_28, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_78, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_91} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:37:31,311 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:31,312 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 237 [2022-12-13 00:37:31,312 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 86 transitions, 713 flow [2022-12-13 00:37:31,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:31,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:31,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:31,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:37:31,313 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:31,313 INFO L85 PathProgramCache]: Analyzing trace with hash 828633552, now seen corresponding path program 3 times [2022-12-13 00:37:31,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:31,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206831827] [2022-12-13 00:37:31,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:31,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:31,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:31,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:31,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206831827] [2022-12-13 00:37:31,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206831827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:31,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:31,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266541947] [2022-12-13 00:37:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:31,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:31,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:31,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:31,782 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2022-12-13 00:37:31,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 86 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:31,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:31,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2022-12-13 00:37:31,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:32,253 INFO L130 PetriNetUnfolder]: 2502/4007 cut-off events. [2022-12-13 00:37:32,254 INFO L131 PetriNetUnfolder]: For 22177/22230 co-relation queries the response was YES. [2022-12-13 00:37:32,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16752 conditions, 4007 events. 2502/4007 cut-off events. For 22177/22230 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 23247 event pairs, 536 based on Foata normal form. 29/3441 useless extension candidates. Maximal degree in co-relation 16723. Up to 2661 conditions per place. [2022-12-13 00:37:32,281 INFO L137 encePairwiseOnDemand]: 25/34 looper letters, 77 selfloop transitions, 36 changer transitions 0/125 dead transitions. [2022-12-13 00:37:32,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 125 transitions, 1160 flow [2022-12-13 00:37:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2022-12-13 00:37:32,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6647058823529411 [2022-12-13 00:37:32,283 INFO L175 Difference]: Start difference. First operand has 73 places, 86 transitions, 713 flow. Second operand 5 states and 113 transitions. [2022-12-13 00:37:32,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 125 transitions, 1160 flow [2022-12-13 00:37:32,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 125 transitions, 1109 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:32,312 INFO L231 Difference]: Finished difference. Result has 76 places, 94 transitions, 875 flow [2022-12-13 00:37:32,312 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=875, PETRI_PLACES=76, PETRI_TRANSITIONS=94} [2022-12-13 00:37:32,313 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2022-12-13 00:37:32,313 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:32,313 INFO L89 Accepts]: Start accepts. Operand has 76 places, 94 transitions, 875 flow [2022-12-13 00:37:32,314 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:32,314 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:32,314 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 94 transitions, 875 flow [2022-12-13 00:37:32,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 94 transitions, 875 flow [2022-12-13 00:37:32,366 INFO L130 PetriNetUnfolder]: 304/657 cut-off events. [2022-12-13 00:37:32,367 INFO L131 PetriNetUnfolder]: For 3607/3691 co-relation queries the response was YES. [2022-12-13 00:37:32,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 657 events. 304/657 cut-off events. For 3607/3691 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4028 event pairs, 52 based on Foata normal form. 15/569 useless extension candidates. Maximal degree in co-relation 2829. Up to 361 conditions per place. [2022-12-13 00:37:32,373 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 94 transitions, 875 flow [2022-12-13 00:37:32,373 INFO L226 LiptonReduction]: Number of co-enabled transitions 1232 [2022-12-13 00:37:32,376 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:32,376 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 00:37:32,376 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 94 transitions, 875 flow [2022-12-13 00:37:32,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:32,377 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:32,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:32,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:37:32,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:32,377 INFO L85 PathProgramCache]: Analyzing trace with hash 916274613, now seen corresponding path program 3 times [2022-12-13 00:37:32,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:32,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321949902] [2022-12-13 00:37:32,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:32,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:32,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:32,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321949902] [2022-12-13 00:37:32,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321949902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:32,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:32,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:32,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961542793] [2022-12-13 00:37:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:32,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:32,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:32,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:32,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:32,828 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:37:32,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 94 transitions, 875 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:32,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:32,828 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:37:32,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:33,479 INFO L130 PetriNetUnfolder]: 3270/5035 cut-off events. [2022-12-13 00:37:33,479 INFO L131 PetriNetUnfolder]: For 26716/26716 co-relation queries the response was YES. [2022-12-13 00:37:33,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21482 conditions, 5035 events. 3270/5035 cut-off events. For 26716/26716 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 28084 event pairs, 841 based on Foata normal form. 55/4349 useless extension candidates. Maximal degree in co-relation 21451. Up to 3281 conditions per place. [2022-12-13 00:37:33,522 INFO L137 encePairwiseOnDemand]: 23/34 looper letters, 101 selfloop transitions, 45 changer transitions 0/154 dead transitions. [2022-12-13 00:37:33,522 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 154 transitions, 1508 flow [2022-12-13 00:37:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:37:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:37:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2022-12-13 00:37:33,523 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5367647058823529 [2022-12-13 00:37:33,524 INFO L175 Difference]: Start difference. First operand has 76 places, 94 transitions, 875 flow. Second operand 8 states and 146 transitions. [2022-12-13 00:37:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 154 transitions, 1508 flow [2022-12-13 00:37:33,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 154 transitions, 1446 flow, removed 31 selfloop flow, removed 0 redundant places. [2022-12-13 00:37:33,567 INFO L231 Difference]: Finished difference. Result has 85 places, 107 transitions, 1105 flow [2022-12-13 00:37:33,567 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1105, PETRI_PLACES=85, PETRI_TRANSITIONS=107} [2022-12-13 00:37:33,567 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 14 predicate places. [2022-12-13 00:37:33,567 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:33,567 INFO L89 Accepts]: Start accepts. Operand has 85 places, 107 transitions, 1105 flow [2022-12-13 00:37:33,568 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:33,568 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:33,568 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 107 transitions, 1105 flow [2022-12-13 00:37:33,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 107 transitions, 1105 flow [2022-12-13 00:37:33,658 INFO L130 PetriNetUnfolder]: 313/713 cut-off events. [2022-12-13 00:37:33,659 INFO L131 PetriNetUnfolder]: For 4679/4771 co-relation queries the response was YES. [2022-12-13 00:37:33,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3424 conditions, 713 events. 313/713 cut-off events. For 4679/4771 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4742 event pairs, 59 based on Foata normal form. 18/613 useless extension candidates. Maximal degree in co-relation 3392. Up to 392 conditions per place. [2022-12-13 00:37:33,665 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 107 transitions, 1105 flow [2022-12-13 00:37:33,665 INFO L226 LiptonReduction]: Number of co-enabled transitions 1364 [2022-12-13 00:37:33,668 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:33,668 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 00:37:33,669 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 107 transitions, 1105 flow [2022-12-13 00:37:33,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:33,669 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:33,669 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:33,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:37:33,669 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:33,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:33,669 INFO L85 PathProgramCache]: Analyzing trace with hash -819461523, now seen corresponding path program 1 times [2022-12-13 00:37:33,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:33,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253672637] [2022-12-13 00:37:33,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:33,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:33,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253672637] [2022-12-13 00:37:33,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253672637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:33,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:33,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:33,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858813043] [2022-12-13 00:37:33,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:33,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:33,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:33,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:33,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:33,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2022-12-13 00:37:33,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 107 transitions, 1105 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-13 00:37:33,747 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:33,747 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2022-12-13 00:37:33,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:34,345 INFO L130 PetriNetUnfolder]: 3749/5959 cut-off events. [2022-12-13 00:37:34,346 INFO L131 PetriNetUnfolder]: For 64750/65243 co-relation queries the response was YES. [2022-12-13 00:37:34,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28937 conditions, 5959 events. 3749/5959 cut-off events. For 64750/65243 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 37848 event pairs, 770 based on Foata normal form. 784/5066 useless extension candidates. Maximal degree in co-relation 28902. Up to 4192 conditions per place. [2022-12-13 00:37:34,456 INFO L137 encePairwiseOnDemand]: 22/34 looper letters, 145 selfloop transitions, 17 changer transitions 24/203 dead transitions. [2022-12-13 00:37:34,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 203 transitions, 2432 flow [2022-12-13 00:37:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:37:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:37:34,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-12-13 00:37:34,457 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7176470588235294 [2022-12-13 00:37:34,458 INFO L175 Difference]: Start difference. First operand has 85 places, 107 transitions, 1105 flow. Second operand 5 states and 122 transitions. [2022-12-13 00:37:34,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 203 transitions, 2432 flow [2022-12-13 00:37:34,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 203 transitions, 2318 flow, removed 31 selfloop flow, removed 6 redundant places. [2022-12-13 00:37:34,494 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 961 flow [2022-12-13 00:37:34,494 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=961, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2022-12-13 00:37:34,495 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 14 predicate places. [2022-12-13 00:37:34,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:34,495 INFO L89 Accepts]: Start accepts. Operand has 85 places, 102 transitions, 961 flow [2022-12-13 00:37:34,496 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:34,496 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:34,496 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 102 transitions, 961 flow [2022-12-13 00:37:34,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 102 transitions, 961 flow [2022-12-13 00:37:34,792 INFO L130 PetriNetUnfolder]: 1654/3077 cut-off events. [2022-12-13 00:37:34,792 INFO L131 PetriNetUnfolder]: For 20333/21537 co-relation queries the response was YES. [2022-12-13 00:37:34,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14592 conditions, 3077 events. 1654/3077 cut-off events. For 20333/21537 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 23794 event pairs, 588 based on Foata normal form. 99/2022 useless extension candidates. Maximal degree in co-relation 14559. Up to 1744 conditions per place. [2022-12-13 00:37:34,828 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 102 transitions, 961 flow [2022-12-13 00:37:34,828 INFO L226 LiptonReduction]: Number of co-enabled transitions 1594 [2022-12-13 00:37:34,836 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] $Ultimate##0-->L775: Formula: (and (= 2 v_~x$w_buff0~0_145) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17|) (= v_~x$r_buff0_thd2~0_76 1) (= v_~x$r_buff0_thd0~0_140 v_~x$r_buff1_thd0~0_139) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_231 256) 0)) (not (= (mod v_~x$w_buff0_used~0_260 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_260 1) (= v_~x$w_buff0~0_146 v_~x$w_buff1~0_126) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$w_buff0_used~0_261 v_~x$w_buff1_used~0_231) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17| 0)) (= v_~x$r_buff1_thd3~0_53 v_~x$r_buff0_thd3~0_59) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_77) (= v_~x$r_buff1_thd1~0_60 v_~x$r_buff0_thd1~0_65)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_146, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_261, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_145, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_126, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_231, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_60, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_260, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [494] $Ultimate##0-->L798: Formula: (and (= v_~y~0_57 v_~__unbuffered_p2_EAX~0_126) (= v_~y~0_57 1) (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_15) (= v_P2Thread1of1ForFork2_~arg.offset_15 |v_P2Thread1of1ForFork2_#in~arg.offset_15|)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_15, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_126, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y~0=v_~y~0_57} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~y~0] [2022-12-13 00:37:35,016 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [426] $Ultimate##0-->L775: Formula: (and (= 2 v_~x$w_buff0~0_145) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17|) (= v_~x$r_buff0_thd2~0_76 1) (= v_~x$r_buff0_thd0~0_140 v_~x$r_buff1_thd0~0_139) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17| (ite (not (and (not (= (mod v_~x$w_buff1_used~0_231 256) 0)) (not (= (mod v_~x$w_buff0_used~0_260 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_260 1) (= v_~x$w_buff0~0_146 v_~x$w_buff1~0_126) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$w_buff0_used~0_261 v_~x$w_buff1_used~0_231) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17| 0)) (= v_~x$r_buff1_thd3~0_53 v_~x$r_buff0_thd3~0_59) (= v_~x$r_buff1_thd2~0_45 v_~x$r_buff0_thd2~0_77) (= v_~x$r_buff1_thd1~0_60 v_~x$r_buff0_thd1~0_65)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_146, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_261, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_145, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_140, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_65, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_126, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_53, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_45, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_231, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_60, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_59, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_76, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_260, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_17|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [329] L746-->L749: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-13 00:37:35,103 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L830-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_64 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [357] L756-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P0Thread1of1ForFork0_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:37:35,132 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L830-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_64 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [385] L808-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.base_9| 0) (= |v_P2Thread1of1ForFork2_#res.offset_9| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-13 00:37:35,160 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L830-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_64 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [480] L756-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.offset_29|) (= |v_P0Thread1of1ForFork0_#res.base_29| 0) (= v_~__unbuffered_cnt~0_281 (+ v_~__unbuffered_cnt~0_282 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_282} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_281} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-13 00:37:35,189 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L830-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_64 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [347] L808-->L811: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:37:35,208 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L830-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_64 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [331] L756-->L759: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] [2022-12-13 00:37:35,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [457] L830-3-->L3: Formula: (and (= v_~main$tmp_guard0~0_64 (ite (= (ite (= v_~__unbuffered_cnt~0_169 3) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_64 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_53| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_53|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_169, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_31|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_64, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [384] L808-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-13 00:37:35,261 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:37:35,264 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 769 [2022-12-13 00:37:35,264 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 100 transitions, 999 flow [2022-12-13 00:37:35,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 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-13 00:37:35,264 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:35,264 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:35,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:37:35,264 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:35,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:35,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1695290846, now seen corresponding path program 1 times [2022-12-13 00:37:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:35,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849936404] [2022-12-13 00:37:35,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:35,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:35,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:35,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:35,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849936404] [2022-12-13 00:37:35,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849936404] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:35,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:35,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:35,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047372463] [2022-12-13 00:37:35,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:35,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:37:35,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:35,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:37:35,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:37:35,350 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 43 [2022-12-13 00:37:35,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 100 transitions, 999 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:35,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:35,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 43 [2022-12-13 00:37:35,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:35,926 INFO L130 PetriNetUnfolder]: 2397/4198 cut-off events. [2022-12-13 00:37:35,926 INFO L131 PetriNetUnfolder]: For 45813/46192 co-relation queries the response was YES. [2022-12-13 00:37:35,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23298 conditions, 4198 events. 2397/4198 cut-off events. For 45813/46192 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 28456 event pairs, 168 based on Foata normal form. 561/3517 useless extension candidates. Maximal degree in co-relation 23262. Up to 2041 conditions per place. [2022-12-13 00:37:35,951 INFO L137 encePairwiseOnDemand]: 25/43 looper letters, 113 selfloop transitions, 32 changer transitions 34/194 dead transitions. [2022-12-13 00:37:35,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 194 transitions, 2315 flow [2022-12-13 00:37:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2022-12-13 00:37:35,953 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5968992248062015 [2022-12-13 00:37:35,953 INFO L175 Difference]: Start difference. First operand has 83 places, 100 transitions, 999 flow. Second operand 6 states and 154 transitions. [2022-12-13 00:37:35,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 194 transitions, 2315 flow [2022-12-13 00:37:35,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 194 transitions, 2093 flow, removed 74 selfloop flow, removed 8 redundant places. [2022-12-13 00:37:35,987 INFO L231 Difference]: Finished difference. Result has 83 places, 104 transitions, 985 flow [2022-12-13 00:37:35,987 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=985, PETRI_PLACES=83, PETRI_TRANSITIONS=104} [2022-12-13 00:37:35,988 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 12 predicate places. [2022-12-13 00:37:35,988 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:35,988 INFO L89 Accepts]: Start accepts. Operand has 83 places, 104 transitions, 985 flow [2022-12-13 00:37:35,988 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:35,989 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:35,989 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 104 transitions, 985 flow [2022-12-13 00:37:35,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 104 transitions, 985 flow [2022-12-13 00:37:36,132 INFO L130 PetriNetUnfolder]: 716/1800 cut-off events. [2022-12-13 00:37:36,132 INFO L131 PetriNetUnfolder]: For 12609/14315 co-relation queries the response was YES. [2022-12-13 00:37:36,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9673 conditions, 1800 events. 716/1800 cut-off events. For 12609/14315 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 15701 event pairs, 126 based on Foata normal form. 47/1125 useless extension candidates. Maximal degree in co-relation 9641. Up to 1126 conditions per place. [2022-12-13 00:37:36,151 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 104 transitions, 985 flow [2022-12-13 00:37:36,151 INFO L226 LiptonReduction]: Number of co-enabled transitions 1656 [2022-12-13 00:37:37,392 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:37,393 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1405 [2022-12-13 00:37:37,393 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 106 transitions, 1038 flow [2022-12-13 00:37:37,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:37,393 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:37,393 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:37,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:37:37,394 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:37,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1556998827, now seen corresponding path program 1 times [2022-12-13 00:37:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:37,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588145258] [2022-12-13 00:37:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:37,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:37,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588145258] [2022-12-13 00:37:37,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588145258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:37,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:37,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:37:37,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385073166] [2022-12-13 00:37:37,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:37,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:37,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:37,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:37,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:37,516 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 45 [2022-12-13 00:37:37,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 106 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:37,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:37,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 45 [2022-12-13 00:37:37,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:37,915 INFO L130 PetriNetUnfolder]: 1767/3253 cut-off events. [2022-12-13 00:37:37,915 INFO L131 PetriNetUnfolder]: For 29003/29274 co-relation queries the response was YES. [2022-12-13 00:37:37,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18599 conditions, 3253 events. 1767/3253 cut-off events. For 29003/29274 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 22498 event pairs, 60 based on Foata normal form. 309/2609 useless extension candidates. Maximal degree in co-relation 18564. Up to 1645 conditions per place. [2022-12-13 00:37:37,937 INFO L137 encePairwiseOnDemand]: 27/45 looper letters, 100 selfloop transitions, 42 changer transitions 31/188 dead transitions. [2022-12-13 00:37:37,937 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 188 transitions, 2179 flow [2022-12-13 00:37:37,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:37:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:37:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2022-12-13 00:37:37,938 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-13 00:37:37,938 INFO L175 Difference]: Start difference. First operand has 84 places, 106 transitions, 1038 flow. Second operand 8 states and 168 transitions. [2022-12-13 00:37:37,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 188 transitions, 2179 flow [2022-12-13 00:37:38,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 188 transitions, 2014 flow, removed 59 selfloop flow, removed 3 redundant places. [2022-12-13 00:37:38,040 INFO L231 Difference]: Finished difference. Result has 90 places, 101 transitions, 930 flow [2022-12-13 00:37:38,040 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=930, PETRI_PLACES=90, PETRI_TRANSITIONS=101} [2022-12-13 00:37:38,040 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 19 predicate places. [2022-12-13 00:37:38,040 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:38,040 INFO L89 Accepts]: Start accepts. Operand has 90 places, 101 transitions, 930 flow [2022-12-13 00:37:38,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:38,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:38,041 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 101 transitions, 930 flow [2022-12-13 00:37:38,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 101 transitions, 930 flow [2022-12-13 00:37:38,132 INFO L130 PetriNetUnfolder]: 347/1134 cut-off events. [2022-12-13 00:37:38,132 INFO L131 PetriNetUnfolder]: For 5014/5630 co-relation queries the response was YES. [2022-12-13 00:37:38,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5192 conditions, 1134 events. 347/1134 cut-off events. For 5014/5630 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 10352 event pairs, 9 based on Foata normal form. 21/613 useless extension candidates. Maximal degree in co-relation 5158. Up to 454 conditions per place. [2022-12-13 00:37:38,146 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 101 transitions, 930 flow [2022-12-13 00:37:38,146 INFO L226 LiptonReduction]: Number of co-enabled transitions 1626 [2022-12-13 00:37:39,403 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:37:39,404 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1364 [2022-12-13 00:37:39,404 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 836 flow [2022-12-13 00:37:39,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:39,404 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:39,405 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:39,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:37:39,405 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:39,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash -413767879, now seen corresponding path program 1 times [2022-12-13 00:37:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:39,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442591186] [2022-12-13 00:37:39,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:39,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:39,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442591186] [2022-12-13 00:37:39,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442591186] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:39,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:39,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:39,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343995870] [2022-12-13 00:37:39,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:39,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:39,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:39,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:39,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:39,525 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 00:37:39,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:39,526 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:39,526 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 00:37:39,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:39,799 INFO L130 PetriNetUnfolder]: 1120/2078 cut-off events. [2022-12-13 00:37:39,800 INFO L131 PetriNetUnfolder]: For 18699/18916 co-relation queries the response was YES. [2022-12-13 00:37:39,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11125 conditions, 2078 events. 1120/2078 cut-off events. For 18699/18916 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 13281 event pairs, 127 based on Foata normal form. 159/1831 useless extension candidates. Maximal degree in co-relation 11088. Up to 959 conditions per place. [2022-12-13 00:37:39,811 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 81 selfloop transitions, 1 changer transitions 54/157 dead transitions. [2022-12-13 00:37:39,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 157 transitions, 1735 flow [2022-12-13 00:37:39,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 00:37:39,812 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2022-12-13 00:37:39,812 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 836 flow. Second operand 4 states and 93 transitions. [2022-12-13 00:37:39,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 157 transitions, 1735 flow [2022-12-13 00:37:39,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 157 transitions, 1529 flow, removed 56 selfloop flow, removed 10 redundant places. [2022-12-13 00:37:39,849 INFO L231 Difference]: Finished difference. Result has 77 places, 81 transitions, 643 flow [2022-12-13 00:37:39,849 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=643, PETRI_PLACES=77, PETRI_TRANSITIONS=81} [2022-12-13 00:37:39,849 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 6 predicate places. [2022-12-13 00:37:39,850 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:39,850 INFO L89 Accepts]: Start accepts. Operand has 77 places, 81 transitions, 643 flow [2022-12-13 00:37:39,850 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:39,850 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:39,850 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 81 transitions, 643 flow [2022-12-13 00:37:39,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 81 transitions, 643 flow [2022-12-13 00:37:39,885 INFO L130 PetriNetUnfolder]: 214/556 cut-off events. [2022-12-13 00:37:39,885 INFO L131 PetriNetUnfolder]: For 2893/3010 co-relation queries the response was YES. [2022-12-13 00:37:39,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2059 conditions, 556 events. 214/556 cut-off events. For 2893/3010 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 3565 event pairs, 5 based on Foata normal form. 25/296 useless extension candidates. Maximal degree in co-relation 2031. Up to 244 conditions per place. [2022-12-13 00:37:39,889 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 81 transitions, 643 flow [2022-12-13 00:37:39,889 INFO L226 LiptonReduction]: Number of co-enabled transitions 956 [2022-12-13 00:37:40,091 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:37:40,092 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-13 00:37:40,092 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 660 flow [2022-12-13 00:37:40,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:40,092 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:40,092 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:40,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 00:37:40,092 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:40,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1930057732, now seen corresponding path program 1 times [2022-12-13 00:37:40,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:40,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990512256] [2022-12-13 00:37:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:40,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:40,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:40,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990512256] [2022-12-13 00:37:40,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990512256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:40,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:40,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:37:40,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870968309] [2022-12-13 00:37:40,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:40,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:37:40,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:40,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:37:40,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:37:40,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 38 [2022-12-13 00:37:40,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:40,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:40,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 38 [2022-12-13 00:37:40,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:40,917 INFO L130 PetriNetUnfolder]: 823/1577 cut-off events. [2022-12-13 00:37:40,918 INFO L131 PetriNetUnfolder]: For 9837/9927 co-relation queries the response was YES. [2022-12-13 00:37:40,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7086 conditions, 1577 events. 823/1577 cut-off events. For 9837/9927 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 9878 event pairs, 22 based on Foata normal form. 100/1347 useless extension candidates. Maximal degree in co-relation 7055. Up to 689 conditions per place. [2022-12-13 00:37:40,931 INFO L137 encePairwiseOnDemand]: 21/38 looper letters, 80 selfloop transitions, 29 changer transitions 23/147 dead transitions. [2022-12-13 00:37:40,931 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 147 transitions, 1316 flow [2022-12-13 00:37:40,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:37:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:37:40,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-12-13 00:37:40,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4901315789473684 [2022-12-13 00:37:40,933 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 660 flow. Second operand 8 states and 149 transitions. [2022-12-13 00:37:40,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 147 transitions, 1316 flow [2022-12-13 00:37:40,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 147 transitions, 1308 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:37:40,956 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 766 flow [2022-12-13 00:37:40,956 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=766, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2022-12-13 00:37:40,956 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places. [2022-12-13 00:37:40,957 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:40,957 INFO L89 Accepts]: Start accepts. Operand has 81 places, 81 transitions, 766 flow [2022-12-13 00:37:40,957 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:40,957 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:40,957 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 81 transitions, 766 flow [2022-12-13 00:37:40,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 81 transitions, 766 flow [2022-12-13 00:37:41,008 INFO L130 PetriNetUnfolder]: 313/743 cut-off events. [2022-12-13 00:37:41,009 INFO L131 PetriNetUnfolder]: For 2972/3118 co-relation queries the response was YES. [2022-12-13 00:37:41,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 743 events. 313/743 cut-off events. For 2972/3118 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 5399 event pairs, 2 based on Foata normal form. 19/323 useless extension candidates. Maximal degree in co-relation 2633. Up to 352 conditions per place. [2022-12-13 00:37:41,015 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 81 transitions, 766 flow [2022-12-13 00:37:41,015 INFO L226 LiptonReduction]: Number of co-enabled transitions 816 [2022-12-13 00:37:41,016 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:37:41,017 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-13 00:37:41,017 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 81 transitions, 766 flow [2022-12-13 00:37:41,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:41,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:41,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:41,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 00:37:41,017 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:41,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1711001456, now seen corresponding path program 1 times [2022-12-13 00:37:41,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:41,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353555400] [2022-12-13 00:37:41,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:41,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:41,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353555400] [2022-12-13 00:37:41,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353555400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:41,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:41,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:37:41,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715348252] [2022-12-13 00:37:41,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:41,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:37:41,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:41,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:37:41,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:37:41,144 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2022-12-13 00:37:41,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 81 transitions, 766 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 00:37:41,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:41,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2022-12-13 00:37:41,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:41,392 INFO L130 PetriNetUnfolder]: 1195/2192 cut-off events. [2022-12-13 00:37:41,392 INFO L131 PetriNetUnfolder]: For 14922/15066 co-relation queries the response was YES. [2022-12-13 00:37:41,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10419 conditions, 2192 events. 1195/2192 cut-off events. For 14922/15066 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 14342 event pairs, 201 based on Foata normal form. 123/1782 useless extension candidates. Maximal degree in co-relation 10386. Up to 821 conditions per place. [2022-12-13 00:37:41,401 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 41 selfloop transitions, 1 changer transitions 73/127 dead transitions. [2022-12-13 00:37:41,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 1411 flow [2022-12-13 00:37:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:37:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:37:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 00:37:41,402 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-13 00:37:41,402 INFO L175 Difference]: Start difference. First operand has 80 places, 81 transitions, 766 flow. Second operand 4 states and 78 transitions. [2022-12-13 00:37:41,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 1411 flow [2022-12-13 00:37:41,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 127 transitions, 1308 flow, removed 37 selfloop flow, removed 4 redundant places. [2022-12-13 00:37:41,437 INFO L231 Difference]: Finished difference. Result has 80 places, 51 transitions, 369 flow [2022-12-13 00:37:41,437 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=369, PETRI_PLACES=80, PETRI_TRANSITIONS=51} [2022-12-13 00:37:41,438 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2022-12-13 00:37:41,438 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:41,438 INFO L89 Accepts]: Start accepts. Operand has 80 places, 51 transitions, 369 flow [2022-12-13 00:37:41,438 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:41,438 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:41,439 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 51 transitions, 369 flow [2022-12-13 00:37:41,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 51 transitions, 369 flow [2022-12-13 00:37:41,471 INFO L130 PetriNetUnfolder]: 230/507 cut-off events. [2022-12-13 00:37:41,471 INFO L131 PetriNetUnfolder]: For 2457/2530 co-relation queries the response was YES. [2022-12-13 00:37:41,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1754 conditions, 507 events. 230/507 cut-off events. For 2457/2530 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 3038 event pairs, 4 based on Foata normal form. 11/205 useless extension candidates. Maximal degree in co-relation 1725. Up to 244 conditions per place. [2022-12-13 00:37:41,477 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 51 transitions, 369 flow [2022-12-13 00:37:41,477 INFO L226 LiptonReduction]: Number of co-enabled transitions 434 [2022-12-13 00:37:41,830 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:37:41,831 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 393 [2022-12-13 00:37:41,831 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 50 transitions, 380 flow [2022-12-13 00:37:41,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 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-13 00:37:41,831 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:41,831 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:41,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 00:37:41,831 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:41,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1995047856, now seen corresponding path program 1 times [2022-12-13 00:37:41,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:41,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187170782] [2022-12-13 00:37:41,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:41,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:37:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:37:42,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:37:42,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187170782] [2022-12-13 00:37:42,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187170782] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:37:42,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:37:42,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:37:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35055225] [2022-12-13 00:37:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:37:42,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:37:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:37:42,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:37:42,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:37:42,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2022-12-13 00:37:42,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 50 transitions, 380 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:42,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:37:42,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2022-12-13 00:37:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:37:42,614 INFO L130 PetriNetUnfolder]: 711/1304 cut-off events. [2022-12-13 00:37:42,614 INFO L131 PetriNetUnfolder]: For 7267/7328 co-relation queries the response was YES. [2022-12-13 00:37:42,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 1304 events. 711/1304 cut-off events. For 7267/7328 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 7852 event pairs, 62 based on Foata normal form. 67/1015 useless extension candidates. Maximal degree in co-relation 5467. Up to 568 conditions per place. [2022-12-13 00:37:42,620 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 38 selfloop transitions, 2 changer transitions 48/99 dead transitions. [2022-12-13 00:37:42,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 99 transitions, 864 flow [2022-12-13 00:37:42,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 00:37:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 00:37:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2022-12-13 00:37:42,621 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2022-12-13 00:37:42,621 INFO L175 Difference]: Start difference. First operand has 66 places, 50 transitions, 380 flow. Second operand 6 states and 82 transitions. [2022-12-13 00:37:42,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 99 transitions, 864 flow [2022-12-13 00:37:42,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 99 transitions, 754 flow, removed 33 selfloop flow, removed 14 redundant places. [2022-12-13 00:37:42,635 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 310 flow [2022-12-13 00:37:42,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=310, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2022-12-13 00:37:42,636 INFO L295 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2022-12-13 00:37:42,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:37:42,636 INFO L89 Accepts]: Start accepts. Operand has 60 places, 49 transitions, 310 flow [2022-12-13 00:37:42,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:37:42,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:37:42,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 49 transitions, 310 flow [2022-12-13 00:37:42,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 310 flow [2022-12-13 00:37:42,664 INFO L130 PetriNetUnfolder]: 206/447 cut-off events. [2022-12-13 00:37:42,664 INFO L131 PetriNetUnfolder]: For 1305/1323 co-relation queries the response was YES. [2022-12-13 00:37:42,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 447 events. 206/447 cut-off events. For 1305/1323 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 2900 event pairs, 0 based on Foata normal form. 5/176 useless extension candidates. Maximal degree in co-relation 1399. Up to 208 conditions per place. [2022-12-13 00:37:42,667 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 310 flow [2022-12-13 00:37:42,667 INFO L226 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-13 00:37:42,668 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L778: Formula: (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|) (= 2 v_~x$w_buff0~0_419) (= v_~x$w_buff0_used~0_603 v_~x$w_buff1_used~0_554) (= v_~x$r_buff0_thd1~0_147 v_~x$r_buff1_thd1~0_145) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_33| |v_P1Thread1of1ForFork1_~arg#1.offset_33|) (= v_~x$r_buff0_thd0~0_384 v_~x$r_buff1_thd0~0_385) (= v_~x$r_buff0_thd3~0_119 v_~x$r_buff1_thd3~0_113) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_602 256) 0)) (not (= (mod v_~x$w_buff1_used~0_554 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|) (= v_~y~0_71 v_~__unbuffered_p1_EAX~0_144) (= v_~x$w_buff0~0_420 v_~x$w_buff1~0_383) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_33| |v_P1Thread1of1ForFork1_~arg#1.base_33|) (= v_~x$w_buff0_used~0_602 1) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_43| 0)) (= v_~x$r_buff1_thd2~0_99 v_~x$r_buff0_thd2~0_153) (= v_~x$r_buff0_thd2~0_152 1)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_420, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_33|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_384, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_147, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_119, ~y~0=v_~y~0_71, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_153, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_33|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_419, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_384, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_147, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_33|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_33|, ~x$w_buff1~0=v_~x$w_buff1~0_383, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_113, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_99, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_554, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_145, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_119, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_152, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_385, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_43|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_602, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_33|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_33|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_144, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|, ~y~0=v_~y~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [519] $Ultimate##0-->L808: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_128 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_646 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_134 256) 0)))) (let ((.cse0 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_593 256) 0)))) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_647 256) 0)) .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_593) v_~x$w_buff1_used~0_592) (= |v_P2Thread1of1ForFork2_#in~arg.base_23| v_P2Thread1of1ForFork2_~arg.base_23) (= (ite .cse0 0 v_~x$r_buff0_thd3~0_134) v_~x$r_buff0_thd3~0_133) (= v_~__unbuffered_p2_EBX~0_148 v_~z~0_54) (= (ite .cse2 v_~x$w_buff0~0_449 (ite .cse1 v_~x$w_buff1~0_407 v_~x~0_546)) v_~x~0_545) (= v_~y~0_75 1) (= v_~y~0_75 v_~__unbuffered_p2_EAX~0_148) (= v_~x$w_buff0_used~0_646 (ite .cse2 0 v_~x$w_buff0_used~0_647)) (= v_P2Thread1of1ForFork2_~arg.offset_23 |v_P2Thread1of1ForFork2_#in~arg.offset_23|) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_592 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_133 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_128) v_~x$r_buff1_thd3~0_127)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_449, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_23|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_128, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_593, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_134, ~z~0=v_~z~0_54, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_23|, ~x~0=v_~x~0_546, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_647} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_449, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_23|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_148, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_23, ~x$w_buff1~0=v_~x$w_buff1~0_407, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_127, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_592, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_133, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_646, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_148, ~z~0=v_~z~0_54, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_23|, ~y~0=v_~y~0_75, ~x~0=v_~x~0_545} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 00:37:42,877 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:37:42,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-13 00:37:42,878 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 315 flow [2022-12-13 00:37:42,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:37:42,878 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:37:42,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:42,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 00:37:42,879 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:37:42,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:37:42,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1940227906, now seen corresponding path program 1 times [2022-12-13 00:37:42,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:37:42,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111750020] [2022-12-13 00:37:42,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:37:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:37:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:37:42,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:37:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:37:42,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:37:42,947 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:37:42,948 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:37:42,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:37:42,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:37:42,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:37:42,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:37:42,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:37:42,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 00:37:42,950 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:37:42,954 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:37:42,954 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:37:43,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:37:43 BasicIcfg [2022-12-13 00:37:43,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:37:43,031 INFO L158 Benchmark]: Toolchain (without parser) took 30058.39ms. Allocated memory was 181.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 155.4MB in the beginning and 694.9MB in the end (delta: -539.5MB). Peak memory consumption was 541.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:43,031 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:37:43,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.75ms. Allocated memory is still 181.4MB. Free memory was 154.9MB in the beginning and 128.6MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:37:43,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.42ms. Allocated memory is still 181.4MB. Free memory was 128.6MB in the beginning and 126.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:43,032 INFO L158 Benchmark]: Boogie Preprocessor took 30.63ms. Allocated memory is still 181.4MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:37:43,032 INFO L158 Benchmark]: RCFGBuilder took 763.03ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 124.0MB in the beginning and 184.8MB in the end (delta: -60.8MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. [2022-12-13 00:37:43,032 INFO L158 Benchmark]: TraceAbstraction took 28768.58ms. Allocated memory was 218.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 183.8MB in the beginning and 694.9MB in the end (delta: -511.1MB). Peak memory consumption was 532.3MB. Max. memory is 8.0GB. [2022-12-13 00:37:43,033 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 181.4MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 438.75ms. Allocated memory is still 181.4MB. Free memory was 154.9MB in the beginning and 128.6MB in the end (delta: 26.3MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.42ms. Allocated memory is still 181.4MB. Free memory was 128.6MB in the beginning and 126.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.63ms. Allocated memory is still 181.4MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 763.03ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 124.0MB in the beginning and 184.8MB in the end (delta: -60.8MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. * TraceAbstraction took 28768.58ms. Allocated memory was 218.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 183.8MB in the beginning and 694.9MB in the end (delta: -511.1MB). Peak memory consumption was 532.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6s, 115 PlacesBefore, 71 PlacesAfterwards, 107 TransitionsBefore, 62 TransitionsAfterwards, 1994 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 39 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 3678, independent unconditional: 0, dependent: 131, dependent conditional: 131, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3809, independent: 3678, independent conditional: 0, independent unconditional: 3678, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2040, independent: 1976, independent conditional: 0, independent unconditional: 1976, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2040, independent: 1939, independent conditional: 0, independent unconditional: 1939, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 101, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3809, independent: 1702, independent conditional: 0, independent unconditional: 1702, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 2040, unknown conditional: 0, unknown unconditional: 2040] , Statistics on independence cache: Total cache size (in pairs): 3738, Positive cache size: 3674, Positive conditional cache size: 0, Positive unconditional cache size: 3674, Negative cache size: 64, Negative conditional cache size: 0, Negative unconditional cache size: 64, 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, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 301, independent: 265, independent conditional: 265, 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: 301, independent: 265, independent conditional: 16, independent unconditional: 249, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 301, independent: 265, independent conditional: 16, independent unconditional: 249, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 301, independent: 265, independent conditional: 16, independent unconditional: 249, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 251, independent: 227, independent conditional: 14, independent unconditional: 213, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 251, independent: 203, independent conditional: 0, independent unconditional: 203, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 48, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 39, dependent conditional: 8, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 301, independent: 38, independent conditional: 2, independent unconditional: 36, dependent: 12, dependent conditional: 3, dependent unconditional: 9, unknown: 251, unknown conditional: 16, unknown unconditional: 235] , Statistics on independence cache: Total cache size (in pairs): 251, Positive cache size: 227, Positive conditional cache size: 14, Positive unconditional cache size: 213, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, 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, 43 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 499, independent: 434, independent conditional: 434, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 499, independent: 434, independent conditional: 33, independent unconditional: 401, dependent: 65, dependent conditional: 2, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 499, independent: 434, independent conditional: 0, independent unconditional: 434, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 499, independent: 434, independent conditional: 0, independent unconditional: 434, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 499, independent: 403, independent conditional: 0, independent unconditional: 403, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 35, unknown conditional: 0, unknown unconditional: 35] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 268, Positive conditional cache size: 15, Positive unconditional cache size: 253, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 210, independent: 185, independent conditional: 185, 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: 210, independent: 185, independent conditional: 17, independent unconditional: 168, 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: 210, independent: 185, independent conditional: 13, independent unconditional: 172, 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: 210, independent: 185, independent conditional: 13, independent unconditional: 172, 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: 35, independent: 29, independent conditional: 2, independent unconditional: 27, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 210, independent: 156, independent conditional: 11, independent unconditional: 145, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 35, unknown conditional: 2, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 331, Positive cache size: 297, Positive conditional cache size: 17, Positive unconditional cache size: 280, Negative cache size: 34, Negative conditional cache size: 2, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 748 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 319, independent: 287, independent conditional: 287, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 319, independent: 287, independent conditional: 42, independent unconditional: 245, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 319, independent: 287, independent conditional: 27, independent unconditional: 260, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 319, independent: 287, independent conditional: 27, independent unconditional: 260, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 10, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 319, independent: 279, independent conditional: 27, independent unconditional: 252, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 305, Positive conditional cache size: 17, Positive unconditional cache size: 288, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 339, independent: 303, independent conditional: 303, 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: 339, independent: 303, independent conditional: 36, independent unconditional: 267, 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: 339, independent: 303, independent conditional: 25, independent unconditional: 278, 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: 339, independent: 303, independent conditional: 25, independent unconditional: 278, 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: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 339, independent: 303, independent conditional: 25, independent unconditional: 278, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 305, Positive conditional cache size: 17, Positive unconditional cache size: 288, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 788 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323, independent: 287, independent conditional: 287, 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: 323, independent: 287, independent conditional: 39, independent unconditional: 248, 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: 323, independent: 287, independent conditional: 28, independent unconditional: 259, 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: 323, independent: 287, independent conditional: 28, independent unconditional: 259, 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: 0, 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: 323, independent: 287, independent conditional: 28, independent unconditional: 259, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 342, Positive cache size: 305, Positive conditional cache size: 17, Positive unconditional cache size: 288, Negative cache size: 37, Negative conditional cache size: 2, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 60 PlacesBefore, 60 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 900 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 701, independent: 638, independent conditional: 638, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 701, independent: 638, independent conditional: 120, independent unconditional: 518, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 701, independent: 638, independent conditional: 89, independent unconditional: 549, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 701, independent: 638, independent conditional: 89, independent unconditional: 549, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 701, independent: 631, independent conditional: 82, independent unconditional: 549, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 8, unknown conditional: 7, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 356, Positive cache size: 318, Positive conditional cache size: 24, Positive unconditional cache size: 294, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 31, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 990 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 308, independent: 271, independent conditional: 271, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 308, independent: 271, independent conditional: 101, independent unconditional: 170, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 308, independent: 271, independent conditional: 95, independent unconditional: 176, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 308, independent: 271, independent conditional: 95, independent unconditional: 176, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 5, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 308, independent: 263, independent conditional: 90, independent unconditional: 173, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 8, unknown conditional: 5, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 326, Positive conditional cache size: 29, Positive unconditional cache size: 297, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 293, independent: 254, independent conditional: 254, 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: 293, independent: 254, independent conditional: 97, independent unconditional: 157, 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: 293, independent: 254, independent conditional: 91, independent unconditional: 163, 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: 293, independent: 254, independent conditional: 91, independent unconditional: 163, 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: 7, independent: 7, independent conditional: 2, independent unconditional: 5, 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: 7, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 293, independent: 247, independent conditional: 89, independent unconditional: 158, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 371, Positive cache size: 333, Positive conditional cache size: 31, Positive unconditional cache size: 302, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 73 PlacesBefore, 73 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 693, independent: 657, independent conditional: 657, 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: 693, independent: 657, independent conditional: 315, independent unconditional: 342, 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: 693, independent: 657, independent conditional: 225, independent unconditional: 432, 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: 693, independent: 657, independent conditional: 225, independent unconditional: 432, 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: 6, independent: 6, independent conditional: 6, 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: 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: 693, independent: 651, independent conditional: 219, independent unconditional: 432, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 345, Positive conditional cache size: 37, Positive unconditional cache size: 308, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 94 TransitionsBefore, 94 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 320, independent: 300, independent conditional: 300, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 320, independent: 300, independent conditional: 132, independent unconditional: 168, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 320, independent: 300, independent conditional: 94, independent unconditional: 206, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 320, independent: 300, independent conditional: 94, independent unconditional: 206, dependent: 20, dependent conditional: 0, dependent unconditional: 20, 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: 320, independent: 300, independent conditional: 94, independent unconditional: 206, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 345, Positive conditional cache size: 37, Positive unconditional cache size: 308, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 85 PlacesBefore, 85 PlacesAfterwards, 107 TransitionsBefore, 107 TransitionsAfterwards, 1364 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 354, independent conditional: 354, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 377, independent: 354, independent conditional: 165, independent unconditional: 189, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 377, independent: 354, independent conditional: 118, independent unconditional: 236, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 377, independent: 354, independent conditional: 118, independent unconditional: 236, dependent: 23, dependent conditional: 0, dependent unconditional: 23, 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: 377, independent: 354, independent conditional: 118, independent unconditional: 236, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 383, Positive cache size: 345, Positive conditional cache size: 37, Positive unconditional cache size: 308, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 47, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 85 PlacesBefore, 83 PlacesAfterwards, 102 TransitionsBefore, 100 TransitionsAfterwards, 1594 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 752, independent: 738, independent conditional: 738, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 752, independent: 738, independent conditional: 486, independent unconditional: 252, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 752, independent: 738, independent conditional: 472, independent unconditional: 266, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 752, independent: 738, independent conditional: 472, independent unconditional: 266, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 752, independent: 725, independent conditional: 459, independent unconditional: 266, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 445, Positive cache size: 407, Positive conditional cache size: 50, Positive unconditional cache size: 357, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 83 PlacesBefore, 84 PlacesAfterwards, 104 TransitionsBefore, 106 TransitionsAfterwards, 1656 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 428, independent: 414, independent conditional: 414, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 428, independent: 414, independent conditional: 224, independent unconditional: 190, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 428, independent: 414, independent conditional: 210, independent unconditional: 204, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 428, independent: 414, independent conditional: 210, independent unconditional: 204, dependent: 14, dependent conditional: 0, dependent unconditional: 14, 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: 428, independent: 414, independent conditional: 210, independent unconditional: 204, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 459, Positive cache size: 421, Positive conditional cache size: 50, Positive unconditional cache size: 371, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 89 PlacesBefore, 86 PlacesAfterwards, 101 TransitionsBefore, 91 TransitionsAfterwards, 1626 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 546, independent: 532, independent conditional: 532, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 546, independent: 532, independent conditional: 378, independent unconditional: 154, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 546, independent: 532, independent conditional: 355, independent unconditional: 177, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 546, independent: 532, independent conditional: 355, independent unconditional: 177, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 71, independent: 71, independent conditional: 69, 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: 71, independent: 71, independent conditional: 0, independent unconditional: 71, 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: 546, independent: 461, independent conditional: 286, independent unconditional: 175, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 71, unknown conditional: 69, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 536, Positive cache size: 498, Positive conditional cache size: 119, Positive unconditional cache size: 379, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 75 PlacesBefore, 74 PlacesAfterwards, 81 TransitionsBefore, 80 TransitionsAfterwards, 956 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 200, independent: 200, independent conditional: 200, 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: 200, independent: 200, independent conditional: 131, independent unconditional: 69, 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: 200, independent: 200, independent conditional: 125, independent unconditional: 75, 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: 200, independent: 200, independent conditional: 125, independent unconditional: 75, 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: 6, independent: 6, independent conditional: 4, 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: 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: 200, independent: 194, independent conditional: 121, independent unconditional: 73, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 709, Positive cache size: 671, Positive conditional cache size: 141, Positive unconditional cache size: 530, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 80 PlacesBefore, 80 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 816 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): 709, Positive cache size: 671, Positive conditional cache size: 141, Positive unconditional cache size: 530, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 67 PlacesBefore, 66 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, independent: 47, independent conditional: 47, 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: 47, independent: 47, independent conditional: 41, independent unconditional: 6, 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: 47, independent: 47, independent conditional: 37, independent unconditional: 10, 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: 47, independent: 47, independent conditional: 37, independent unconditional: 10, 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: 4, independent: 4, independent conditional: 3, 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: 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: 47, independent: 43, independent conditional: 34, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 757, Positive cache size: 719, Positive conditional cache size: 162, Positive unconditional cache size: 557, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 57 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 4, 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: 3, independent: 3, independent conditional: 3, 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: 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: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 764, Positive cache size: 726, Positive conditional cache size: 165, Positive unconditional cache size: 561, Negative cache size: 38, Negative conditional cache size: 2, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-3, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-2, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=-1, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 [L777] 2 __unbuffered_p1_EAX = y [L794] 2 y = 1 [L797] 2 __unbuffered_p2_EAX = y [L800] 2 __unbuffered_p2_EBX = z [L803] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, 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: 826]: 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: 828]: 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: 830]: 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 7 procedures, 138 locations, 6 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: 28.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 683 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2175 IncrementalHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 22 mSDtfsCounter, 2175 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1105occurred in iteration=12, InterpolantAutomatonStates: 98, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 3718 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-13 00:37:43,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...