/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:07:39,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:07:39,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:07:39,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:07:39,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:07:39,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:07:39,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:07:39,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:07:39,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:07:39,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:07:39,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:07:39,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:07:39,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:07:39,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:07:39,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:07:39,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:07:39,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:07:39,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:07:39,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:07:39,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:07:39,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:07:39,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:07:39,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:07:39,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:07:39,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:07:39,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:07:39,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:07:39,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:07:39,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:07:39,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:07:39,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:07:39,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:07:39,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:07:39,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:07:39,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:07:39,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:07:39,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:07:39,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:07:39,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:07:39,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:07:39,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:07:39,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:07:39,536 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:07:39,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:07:39,538 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:07:39,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:07:39,538 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:07:39,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:07:39,539 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:07:39,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:07:39,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:07:39,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:07:39,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:07:39,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:07:39,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:07:39,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:07:39,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:07:39,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:07:39,540 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:07:39,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:07:39,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:07:39,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:07:39,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:07:39,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:07:39,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:07:39,541 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:07:39,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:07:39,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:07:39,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:07:39,542 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:07:39,542 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:07:39,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:07:39,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:07:39,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:07:39,855 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:07:39,855 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:07:39,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2022-12-06 04:07:40,894 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:07:41,123 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:07:41,124 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2022-12-06 04:07:41,135 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7cd8587/9e0b567806824f2a973c9307ccc3d6ec/FLAG858c3473d [2022-12-06 04:07:41,146 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db7cd8587/9e0b567806824f2a973c9307ccc3d6ec [2022-12-06 04:07:41,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:07:41,149 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:07:41,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:07:41,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:07:41,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:07:41,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e0daed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41, skipping insertion in model container [2022-12-06 04:07:41,152 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:07:41,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:07:41,294 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/mix008_tso.oepc.i[949,962] [2022-12-06 04:07:41,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:07:41,532 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:07:41,542 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/mix008_tso.oepc.i[949,962] [2022-12-06 04:07:41,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,597 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:07:41,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:07:41,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:07:41,641 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:07:41,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41 WrapperNode [2022-12-06 04:07:41,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:07:41,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:07:41,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:07:41,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:07:41,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,718 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 274 [2022-12-06 04:07:41,719 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:07:41,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:07:41,720 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:07:41,720 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:07:41,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,741 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:07:41,746 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:07:41,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:07:41,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:07:41,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (1/1) ... [2022-12-06 04:07:41,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:07:41,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:07:41,785 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:07:41,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:07:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:07:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:07:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:07:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:07:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:07:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:07:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:07:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:07:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:07:41,821 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:07:41,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:07:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:07:41,822 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:07:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:07:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:07:41,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:07:41,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:07:41,824 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:07:41,997 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:07:41,998 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:07:42,422 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:07:42,607 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:07:42,607 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:07:42,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:07:42 BoogieIcfgContainer [2022-12-06 04:07:42,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:07:42,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:07:42,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:07:42,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:07:42,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:07:41" (1/3) ... [2022-12-06 04:07:42,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af1540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:07:42, skipping insertion in model container [2022-12-06 04:07:42,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:07:41" (2/3) ... [2022-12-06 04:07:42,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af1540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:07:42, skipping insertion in model container [2022-12-06 04:07:42,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:07:42" (3/3) ... [2022-12-06 04:07:42,616 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2022-12-06 04:07:42,635 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:07:42,636 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-06 04:07:42,636 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:07:42,692 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:07:42,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 320 flow [2022-12-06 04:07:42,787 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-12-06 04:07:42,788 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:07:42,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 04:07:42,794 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 150 transitions, 320 flow [2022-12-06 04:07:42,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 146 transitions, 304 flow [2022-12-06 04:07:42,802 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:42,825 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 304 flow [2022-12-06 04:07:42,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 304 flow [2022-12-06 04:07:42,878 INFO L130 PetriNetUnfolder]: 2/146 cut-off events. [2022-12-06 04:07:42,878 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:07:42,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 2/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 04:07:42,884 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 304 flow [2022-12-06 04:07:42,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 3210 [2022-12-06 04:07:50,212 INFO L203 LiptonReduction]: Total number of compositions: 115 [2022-12-06 04:07:50,222 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:07:50,233 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;@645f0d04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:07:50,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-12-06 04:07:50,236 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 04:07:50,236 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:07:50,236 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:50,237 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:50,237 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:07:50,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2082288755, now seen corresponding path program 1 times [2022-12-06 04:07:50,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:50,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065544119] [2022-12-06 04:07:50,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:50,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:50,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-06 04:07:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:50,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065544119] [2022-12-06 04:07:50,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065544119] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:50,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:50,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:07:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785369057] [2022-12-06 04:07:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:50,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:07:50,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:07:50,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:07:50,626 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:07:50,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:50,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:50,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:07:50,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:51,997 INFO L130 PetriNetUnfolder]: 8085/10964 cut-off events. [2022-12-06 04:07:51,998 INFO L131 PetriNetUnfolder]: For 66/66 co-relation queries the response was YES. [2022-12-06 04:07:52,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22070 conditions, 10964 events. 8085/10964 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 59058 event pairs, 990 based on Foata normal form. 0/9580 useless extension candidates. Maximal degree in co-relation 22058. Up to 9436 conditions per place. [2022-12-06 04:07:52,063 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 43 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2022-12-06 04:07:52,063 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 209 flow [2022-12-06 04:07:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:07:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:07:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 04:07:52,072 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2022-12-06 04:07:52,073 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 61 transitions. [2022-12-06 04:07:52,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 209 flow [2022-12-06 04:07:52,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:07:52,078 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 74 flow [2022-12-06 04:07:52,080 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2022-12-06 04:07:52,082 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 04:07:52,082 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:52,083 INFO L89 Accepts]: Start accepts. Operand has 43 places, 31 transitions, 74 flow [2022-12-06 04:07:52,084 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:52,085 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:52,085 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 74 flow [2022-12-06 04:07:52,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 74 flow [2022-12-06 04:07:52,090 INFO L130 PetriNetUnfolder]: 0/31 cut-off events. [2022-12-06 04:07:52,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:07:52,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:07:52,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 74 flow [2022-12-06 04:07:52,091 INFO L188 LiptonReduction]: Number of co-enabled transitions 506 [2022-12-06 04:07:52,253 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:07:52,255 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 04:07:52,255 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2022-12-06 04:07:52,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:52,256 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:52,256 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:52,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:07:52,259 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:07:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:52,259 INFO L85 PathProgramCache]: Analyzing trace with hash 375363279, now seen corresponding path program 1 times [2022-12-06 04:07:52,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:52,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339857453] [2022-12-06 04:07:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:52,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:52,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339857453] [2022-12-06 04:07:52,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339857453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:52,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:52,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:07:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404974229] [2022-12-06 04:07:52,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:52,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:07:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:52,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:07:52,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:07:52,411 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 04:07:52,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:52,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:52,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 04:07:52,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:53,392 INFO L130 PetriNetUnfolder]: 6591/9362 cut-off events. [2022-12-06 04:07:53,392 INFO L131 PetriNetUnfolder]: For 375/375 co-relation queries the response was YES. [2022-12-06 04:07:53,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18852 conditions, 9362 events. 6591/9362 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 52253 event pairs, 1263 based on Foata normal form. 0/8638 useless extension candidates. Maximal degree in co-relation 18842. Up to 7057 conditions per place. [2022-12-06 04:07:53,480 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 36 selfloop transitions, 2 changer transitions 4/45 dead transitions. [2022-12-06 04:07:53,481 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 188 flow [2022-12-06 04:07:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:07:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:07:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 04:07:53,482 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2022-12-06 04:07:53,482 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 3 states and 52 transitions. [2022-12-06 04:07:53,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 188 flow [2022-12-06 04:07:53,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:07:53,485 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2022-12-06 04:07:53,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-06 04:07:53,486 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2022-12-06 04:07:53,486 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:53,486 INFO L89 Accepts]: Start accepts. Operand has 41 places, 28 transitions, 68 flow [2022-12-06 04:07:53,486 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:53,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:53,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 68 flow [2022-12-06 04:07:53,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2022-12-06 04:07:53,496 INFO L130 PetriNetUnfolder]: 0/28 cut-off events. [2022-12-06 04:07:53,496 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:07:53,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:07:53,497 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2022-12-06 04:07:53,497 INFO L188 LiptonReduction]: Number of co-enabled transitions 404 [2022-12-06 04:07:53,523 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:07:53,524 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 04:07:53,525 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2022-12-06 04:07:53,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:53,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:53,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:53,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:07:53,527 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:07:53,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash -53102605, now seen corresponding path program 1 times [2022-12-06 04:07:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:53,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818328270] [2022-12-06 04:07:53,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:53,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:54,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:54,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818328270] [2022-12-06 04:07:54,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818328270] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:54,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:54,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:07:54,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46910378] [2022-12-06 04:07:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:54,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:07:54,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:54,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:07:54,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:07:54,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:07:54,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:54,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:54,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:07:54,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:55,451 INFO L130 PetriNetUnfolder]: 10825/14794 cut-off events. [2022-12-06 04:07:55,452 INFO L131 PetriNetUnfolder]: For 560/560 co-relation queries the response was YES. [2022-12-06 04:07:55,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30562 conditions, 14794 events. 10825/14794 cut-off events. For 560/560 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 73933 event pairs, 2429 based on Foata normal form. 480/15274 useless extension candidates. Maximal degree in co-relation 30552. Up to 9521 conditions per place. [2022-12-06 04:07:55,524 INFO L137 encePairwiseOnDemand]: 16/28 looper letters, 50 selfloop transitions, 11 changer transitions 0/61 dead transitions. [2022-12-06 04:07:55,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 264 flow [2022-12-06 04:07:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:07:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:07:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 04:07:55,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 04:07:55,527 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states and 63 transitions. [2022-12-06 04:07:55,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 264 flow [2022-12-06 04:07:55,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:07:55,534 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 148 flow [2022-12-06 04:07:55,534 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2022-12-06 04:07:55,535 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2022-12-06 04:07:55,535 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:55,536 INFO L89 Accepts]: Start accepts. Operand has 43 places, 37 transitions, 148 flow [2022-12-06 04:07:55,537 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:55,537 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:55,537 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 37 transitions, 148 flow [2022-12-06 04:07:55,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 148 flow [2022-12-06 04:07:55,698 INFO L130 PetriNetUnfolder]: 673/1193 cut-off events. [2022-12-06 04:07:55,699 INFO L131 PetriNetUnfolder]: For 177/198 co-relation queries the response was YES. [2022-12-06 04:07:55,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 1193 events. 673/1193 cut-off events. For 177/198 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 6920 event pairs, 380 based on Foata normal form. 0/1149 useless extension candidates. Maximal degree in co-relation 2650. Up to 888 conditions per place. [2022-12-06 04:07:55,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 37 transitions, 148 flow [2022-12-06 04:07:55,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 448 [2022-12-06 04:07:55,734 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:07:55,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 200 [2022-12-06 04:07:55,735 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 148 flow [2022-12-06 04:07:55,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:55,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:55,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:55,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:07:55,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:07:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1018086783, now seen corresponding path program 1 times [2022-12-06 04:07:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:55,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899418174] [2022-12-06 04:07:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:56,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:56,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899418174] [2022-12-06 04:07:56,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899418174] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:56,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:56,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:07:56,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901122385] [2022-12-06 04:07:56,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:56,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:07:56,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:56,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:07:56,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:07:56,473 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:07:56,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 148 flow. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:56,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:56,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:07:56,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:07:58,359 INFO L130 PetriNetUnfolder]: 13477/18542 cut-off events. [2022-12-06 04:07:58,359 INFO L131 PetriNetUnfolder]: For 8468/8468 co-relation queries the response was YES. [2022-12-06 04:07:58,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49651 conditions, 18542 events. 13477/18542 cut-off events. For 8468/8468 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 96032 event pairs, 4073 based on Foata normal form. 288/18830 useless extension candidates. Maximal degree in co-relation 49638. Up to 9138 conditions per place. [2022-12-06 04:07:58,439 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 82 selfloop transitions, 20 changer transitions 2/104 dead transitions. [2022-12-06 04:07:58,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 104 transitions, 574 flow [2022-12-06 04:07:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:07:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:07:58,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-06 04:07:58,441 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5654761904761905 [2022-12-06 04:07:58,441 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 148 flow. Second operand 6 states and 95 transitions. [2022-12-06 04:07:58,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 104 transitions, 574 flow [2022-12-06 04:07:58,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 104 transitions, 569 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:07:58,466 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 326 flow [2022-12-06 04:07:58,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2022-12-06 04:07:58,467 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2022-12-06 04:07:58,467 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:07:58,467 INFO L89 Accepts]: Start accepts. Operand has 52 places, 55 transitions, 326 flow [2022-12-06 04:07:58,468 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:07:58,468 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:07:58,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 326 flow [2022-12-06 04:07:58,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 326 flow [2022-12-06 04:07:58,633 INFO L130 PetriNetUnfolder]: 843/1549 cut-off events. [2022-12-06 04:07:58,634 INFO L131 PetriNetUnfolder]: For 1558/1687 co-relation queries the response was YES. [2022-12-06 04:07:58,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4587 conditions, 1549 events. 843/1549 cut-off events. For 1558/1687 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 9692 event pairs, 434 based on Foata normal form. 8/1517 useless extension candidates. Maximal degree in co-relation 4571. Up to 1119 conditions per place. [2022-12-06 04:07:58,647 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 326 flow [2022-12-06 04:07:58,647 INFO L188 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-06 04:07:58,685 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:07:58,690 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 223 [2022-12-06 04:07:58,690 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 326 flow [2022-12-06 04:07:58,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:58,690 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:07:58,690 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:07:58,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:07:58,690 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:07:58,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:07:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1468823956, now seen corresponding path program 1 times [2022-12-06 04:07:58,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:07:58,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532995052] [2022-12-06 04:07:58,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:07:58,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:07:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:07:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:07:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:07:59,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532995052] [2022-12-06 04:07:59,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532995052] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:07:59,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:07:59,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:07:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817407702] [2022-12-06 04:07:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:07:59,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:07:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:07:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:07:59,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:07:59,110 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 04:07:59,110 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 326 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:07:59,110 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:07:59,110 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 04:07:59,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:00,822 INFO L130 PetriNetUnfolder]: 11791/16292 cut-off events. [2022-12-06 04:08:00,823 INFO L131 PetriNetUnfolder]: For 17689/17689 co-relation queries the response was YES. [2022-12-06 04:08:00,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52473 conditions, 16292 events. 11791/16292 cut-off events. For 17689/17689 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 82523 event pairs, 3272 based on Foata normal form. 128/16420 useless extension candidates. Maximal degree in co-relation 52454. Up to 9619 conditions per place. [2022-12-06 04:08:00,919 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 75 selfloop transitions, 22 changer transitions 2/99 dead transitions. [2022-12-06 04:08:00,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 780 flow [2022-12-06 04:08:00,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:08:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:08:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-12-06 04:08:00,920 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2022-12-06 04:08:00,920 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 326 flow. Second operand 4 states and 58 transitions. [2022-12-06 04:08:00,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 780 flow [2022-12-06 04:08:00,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 758 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-12-06 04:08:00,938 INFO L231 Difference]: Finished difference. Result has 58 places, 69 transitions, 527 flow [2022-12-06 04:08:00,938 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=527, PETRI_PLACES=58, PETRI_TRANSITIONS=69} [2022-12-06 04:08:00,941 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2022-12-06 04:08:00,941 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:00,941 INFO L89 Accepts]: Start accepts. Operand has 58 places, 69 transitions, 527 flow [2022-12-06 04:08:00,942 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:00,942 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:00,942 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 69 transitions, 527 flow [2022-12-06 04:08:00,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 69 transitions, 527 flow [2022-12-06 04:08:01,094 INFO L130 PetriNetUnfolder]: 779/1426 cut-off events. [2022-12-06 04:08:01,094 INFO L131 PetriNetUnfolder]: For 2779/2907 co-relation queries the response was YES. [2022-12-06 04:08:01,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5445 conditions, 1426 events. 779/1426 cut-off events. For 2779/2907 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8574 event pairs, 340 based on Foata normal form. 13/1423 useless extension candidates. Maximal degree in co-relation 5424. Up to 985 conditions per place. [2022-12-06 04:08:01,105 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 69 transitions, 527 flow [2022-12-06 04:08:01,105 INFO L188 LiptonReduction]: Number of co-enabled transitions 616 [2022-12-06 04:08:01,166 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:01,168 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-06 04:08:01,168 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 69 transitions, 527 flow [2022-12-06 04:08:01,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:01,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:01,168 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:01,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:08:01,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:08:01,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:01,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1504383209, now seen corresponding path program 1 times [2022-12-06 04:08:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:01,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139062545] [2022-12-06 04:08:01,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:01,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:01,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139062545] [2022-12-06 04:08:01,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139062545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:01,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:01,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:08:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907937173] [2022-12-06 04:08:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:01,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:01,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:01,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:01,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:01,405 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 04:08:01,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 69 transitions, 527 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:01,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:01,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 04:08:01,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:02,723 INFO L130 PetriNetUnfolder]: 7021/10088 cut-off events. [2022-12-06 04:08:02,723 INFO L131 PetriNetUnfolder]: For 37780/39356 co-relation queries the response was YES. [2022-12-06 04:08:02,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37740 conditions, 10088 events. 7021/10088 cut-off events. For 37780/39356 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 57527 event pairs, 1136 based on Foata normal form. 1347/11186 useless extension candidates. Maximal degree in co-relation 37716. Up to 6173 conditions per place. [2022-12-06 04:08:02,776 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 117 selfloop transitions, 9 changer transitions 29/168 dead transitions. [2022-12-06 04:08:02,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 168 transitions, 1567 flow [2022-12-06 04:08:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:08:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:08:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-06 04:08:02,778 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.65 [2022-12-06 04:08:02,778 INFO L175 Difference]: Start difference. First operand has 58 places, 69 transitions, 527 flow. Second operand 5 states and 91 transitions. [2022-12-06 04:08:02,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 168 transitions, 1567 flow [2022-12-06 04:08:02,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 168 transitions, 1510 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-06 04:08:02,798 INFO L231 Difference]: Finished difference. Result has 64 places, 74 transitions, 566 flow [2022-12-06 04:08:02,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=566, PETRI_PLACES=64, PETRI_TRANSITIONS=74} [2022-12-06 04:08:02,799 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2022-12-06 04:08:02,799 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:02,799 INFO L89 Accepts]: Start accepts. Operand has 64 places, 74 transitions, 566 flow [2022-12-06 04:08:02,800 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:02,800 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:02,800 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 74 transitions, 566 flow [2022-12-06 04:08:02,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 74 transitions, 566 flow [2022-12-06 04:08:03,206 INFO L130 PetriNetUnfolder]: 1794/3165 cut-off events. [2022-12-06 04:08:03,206 INFO L131 PetriNetUnfolder]: For 10373/11766 co-relation queries the response was YES. [2022-12-06 04:08:03,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12270 conditions, 3165 events. 1794/3165 cut-off events. For 10373/11766 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 22619 event pairs, 940 based on Foata normal form. 181/3032 useless extension candidates. Maximal degree in co-relation 12245. Up to 1648 conditions per place. [2022-12-06 04:08:03,233 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 74 transitions, 566 flow [2022-12-06 04:08:03,233 INFO L188 LiptonReduction]: Number of co-enabled transitions 902 [2022-12-06 04:08:03,278 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] $Ultimate##0-->L816: Formula: (and (= v_~y$w_buff0_used~0_243 1) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~y$r_buff0_thd0~0_107 v_~y$r_buff1_thd0~0_102) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_243 256) 0)) (not (= (mod v_~y$w_buff1_used~0_212 256) 0)))) 1 0)) (= v_~y$r_buff0_thd3~0_82 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd3~0_83 v_~y$r_buff1_thd3~0_67) (= 2 v_~y$w_buff0~0_148) (= v_~y$r_buff0_thd2~0_33 v_~y$r_buff1_thd2~0_27) (= v_~y$w_buff0_used~0_244 v_~y$w_buff1_used~0_212) (= v_~y$r_buff0_thd4~0_45 v_~y$r_buff1_thd4~0_43) (= v_~y$w_buff1~0_139 v_~y$w_buff0~0_149) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_244, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_83, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_149, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_243, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_67, ~y$w_buff1~0=v_~y$w_buff1~0_139, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_148, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [558] L771-->L774: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-06 04:08:03,367 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] $Ultimate##0-->L816: Formula: (and (= v_~y$w_buff0_used~0_243 1) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~y$r_buff0_thd0~0_107 v_~y$r_buff1_thd0~0_102) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_243 256) 0)) (not (= (mod v_~y$w_buff1_used~0_212 256) 0)))) 1 0)) (= v_~y$r_buff0_thd3~0_82 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd3~0_83 v_~y$r_buff1_thd3~0_67) (= 2 v_~y$w_buff0~0_148) (= v_~y$r_buff0_thd2~0_33 v_~y$r_buff1_thd2~0_27) (= v_~y$w_buff0_used~0_244 v_~y$w_buff1_used~0_212) (= v_~y$r_buff0_thd4~0_45 v_~y$r_buff1_thd4~0_43) (= v_~y$w_buff1~0_139 v_~y$w_buff0~0_149) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_244, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_83, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_149, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_243, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_67, ~y$w_buff1~0=v_~y$w_buff1~0_139, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_148, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [675] $Ultimate##0-->L786: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~x~0_53 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 04:08:03,689 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] $Ultimate##0-->L816: Formula: (and (= v_~y$w_buff0_used~0_243 1) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~y$r_buff0_thd0~0_107 v_~y$r_buff1_thd0~0_102) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_243 256) 0)) (not (= (mod v_~y$w_buff1_used~0_212 256) 0)))) 1 0)) (= v_~y$r_buff0_thd3~0_82 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd3~0_83 v_~y$r_buff1_thd3~0_67) (= 2 v_~y$w_buff0~0_148) (= v_~y$r_buff0_thd2~0_33 v_~y$r_buff1_thd2~0_27) (= v_~y$w_buff0_used~0_244 v_~y$w_buff1_used~0_212) (= v_~y$r_buff0_thd4~0_45 v_~y$r_buff1_thd4~0_43) (= v_~y$w_buff1~0_139 v_~y$w_buff0~0_149) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_244, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_83, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_149, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_243, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_67, ~y$w_buff1~0=v_~y$w_buff1~0_139, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_148, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [583] L894-->L906: Formula: (let ((.cse6 (not (= (mod v_~y$r_buff1_thd4~0_30 256) 0))) (.cse9 (not (= (mod v_~z$w_buff0_used~0_135 256) 0))) (.cse8 (not (= (mod v_~z$r_buff1_thd4~0_66 256) 0))) (.cse7 (not (= (mod v_~y$w_buff0_used~0_175 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd4~0_32 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd4~0_81 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff0_used~0_136 256) 0)) .cse11)) (.cse4 (and .cse7 .cse10)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_123 256) 0)) .cse8)) (.cse0 (and .cse9 .cse11)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_176 256) 0)) .cse10)) (.cse5 (and (not (= (mod v_~y$w_buff1_used~0_153 256) 0)) .cse6))) (and (= v_~z$r_buff0_thd4~0_80 (ite .cse0 0 v_~z$r_buff0_thd4~0_81)) (= v_~z~0_100 (ite .cse1 v_~z$w_buff0~0_62 (ite .cse2 v_~z$w_buff1~0_73 v_~z~0_101))) (= (ite .cse1 0 v_~z$w_buff0_used~0_136) v_~z$w_buff0_used~0_135) (= v_~y$w_buff0_used~0_175 (ite .cse3 0 v_~y$w_buff0_used~0_176)) (= v_~y$r_buff0_thd4~0_31 (ite .cse4 0 v_~y$r_buff0_thd4~0_32)) (= v_~y$w_buff1_used~0_152 (ite (or .cse5 .cse4) 0 v_~y$w_buff1_used~0_153)) (= (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_152 256) 0))) (and .cse7 (not (= (mod v_~y$r_buff0_thd4~0_31 256) 0)))) 0 v_~y$r_buff1_thd4~0_30) v_~y$r_buff1_thd4~0_29) (= v_~z$w_buff1_used~0_122 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_123)) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_122 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$r_buff0_thd4~0_80 256) 0)))) 0 v_~z$r_buff1_thd4~0_66) v_~z$r_buff1_thd4~0_65) (= v_~y~0_135 (ite .cse3 v_~y$w_buff0~0_86 (ite .cse5 v_~y$w_buff1~0_85 v_~y~0_136)))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_66, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_176, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~z$w_buff0~0=v_~z$w_buff0~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_123, ~z$w_buff1~0=v_~z$w_buff1~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_30, ~y$w_buff1~0=v_~y$w_buff1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_81, ~z~0=v_~z~0_101, ~y~0=v_~y~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_153} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_65, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_175, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_135, ~z$w_buff0~0=v_~z$w_buff0~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_122, ~z$w_buff1~0=v_~z$w_buff1~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_31, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_29, ~y$w_buff1~0=v_~y$w_buff1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_80, ~z~0=v_~z~0_100, ~y~0=v_~y~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_152} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~z$r_buff1_thd4~0, ~y$w_buff0_used~0, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:08:03,995 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [614] $Ultimate##0-->L816: Formula: (and (= v_~y$w_buff0_used~0_243 1) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~y$r_buff0_thd0~0_107 v_~y$r_buff1_thd0~0_102) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_243 256) 0)) (not (= (mod v_~y$w_buff1_used~0_212 256) 0)))) 1 0)) (= v_~y$r_buff0_thd3~0_82 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd3~0_83 v_~y$r_buff1_thd3~0_67) (= 2 v_~y$w_buff0~0_148) (= v_~y$r_buff0_thd2~0_33 v_~y$r_buff1_thd2~0_27) (= v_~y$w_buff0_used~0_244 v_~y$w_buff1_used~0_212) (= v_~y$r_buff0_thd4~0_45 v_~y$r_buff1_thd4~0_43) (= v_~y$w_buff1~0_139 v_~y$w_buff0~0_149) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_244, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_83, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_149, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_243, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_67, ~y$w_buff1~0=v_~y$w_buff1~0_139, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_148, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [558] L771-->L774: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-06 04:08:04,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] L930-3-->L934: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_131 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_25|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [663] L774-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_88 1) v_~__unbuffered_cnt~0_87)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:08:04,118 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] L930-3-->L934: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_131 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_25|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [687] L796-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_15| 0) (= (+ v_~__unbuffered_cnt~0_114 1) v_~__unbuffered_cnt~0_113) (= |v_P1Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_15|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 04:08:04,142 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] L930-3-->L934: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_131 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_25|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [616] L855-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P2Thread1of1ForFork0_#res#1.base_9| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_9|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-06 04:08:04,174 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:08:04,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1376 [2022-12-06 04:08:04,175 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 72 transitions, 584 flow [2022-12-06 04:08:04,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:04,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:04,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:04,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:08:04,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:08:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:04,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1038949959, now seen corresponding path program 1 times [2022-12-06 04:08:04,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:04,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253702624] [2022-12-06 04:08:04,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:04,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:04,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253702624] [2022-12-06 04:08:04,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253702624] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:04,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:04,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:08:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187087539] [2022-12-06 04:08:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:04,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:08:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:08:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:08:04,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 36 [2022-12-06 04:08:04,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 72 transitions, 584 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:04,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:04,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 36 [2022-12-06 04:08:04,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:05,212 INFO L130 PetriNetUnfolder]: 4901/7368 cut-off events. [2022-12-06 04:08:05,212 INFO L131 PetriNetUnfolder]: For 36223/37966 co-relation queries the response was YES. [2022-12-06 04:08:05,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32303 conditions, 7368 events. 4901/7368 cut-off events. For 36223/37966 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 43137 event pairs, 542 based on Foata normal form. 1015/8233 useless extension candidates. Maximal degree in co-relation 32275. Up to 3245 conditions per place. [2022-12-06 04:08:05,251 INFO L137 encePairwiseOnDemand]: 26/36 looper letters, 129 selfloop transitions, 16 changer transitions 29/185 dead transitions. [2022-12-06 04:08:05,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 185 transitions, 1774 flow [2022-12-06 04:08:05,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:08:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:08:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-06 04:08:05,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 04:08:05,253 INFO L175 Difference]: Start difference. First operand has 62 places, 72 transitions, 584 flow. Second operand 6 states and 120 transitions. [2022-12-06 04:08:05,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 185 transitions, 1774 flow [2022-12-06 04:08:05,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 185 transitions, 1743 flow, removed 13 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:05,274 INFO L231 Difference]: Finished difference. Result has 68 places, 80 transitions, 692 flow [2022-12-06 04:08:05,287 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=692, PETRI_PLACES=68, PETRI_TRANSITIONS=80} [2022-12-06 04:08:05,288 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2022-12-06 04:08:05,288 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:05,288 INFO L89 Accepts]: Start accepts. Operand has 68 places, 80 transitions, 692 flow [2022-12-06 04:08:05,289 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:05,289 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:05,289 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 80 transitions, 692 flow [2022-12-06 04:08:05,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 80 transitions, 692 flow [2022-12-06 04:08:05,521 INFO L130 PetriNetUnfolder]: 962/2081 cut-off events. [2022-12-06 04:08:05,521 INFO L131 PetriNetUnfolder]: For 13210/15872 co-relation queries the response was YES. [2022-12-06 04:08:05,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9890 conditions, 2081 events. 962/2081 cut-off events. For 13210/15872 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 16080 event pairs, 276 based on Foata normal form. 188/2142 useless extension candidates. Maximal degree in co-relation 9862. Up to 1237 conditions per place. [2022-12-06 04:08:05,546 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 80 transitions, 692 flow [2022-12-06 04:08:05,546 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 04:08:05,558 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:05,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 270 [2022-12-06 04:08:05,558 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 692 flow [2022-12-06 04:08:05,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:05,559 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:05,559 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:05,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:08:05,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:08:05,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:05,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1552807930, now seen corresponding path program 1 times [2022-12-06 04:08:05,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:05,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314037907] [2022-12-06 04:08:05,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314037907] [2022-12-06 04:08:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314037907] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:06,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:06,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:08:06,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247996001] [2022-12-06 04:08:06,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:06,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:08:06,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:06,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:08:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:08:06,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 04:08:06,531 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 692 flow. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:06,531 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:06,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 04:08:06,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:08,316 INFO L130 PetriNetUnfolder]: 9607/14643 cut-off events. [2022-12-06 04:08:08,316 INFO L131 PetriNetUnfolder]: For 66303/66303 co-relation queries the response was YES. [2022-12-06 04:08:08,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71533 conditions, 14643 events. 9607/14643 cut-off events. For 66303/66303 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 92199 event pairs, 1111 based on Foata normal form. 57/14700 useless extension candidates. Maximal degree in co-relation 71502. Up to 7230 conditions per place. [2022-12-06 04:08:08,393 INFO L137 encePairwiseOnDemand]: 19/36 looper letters, 151 selfloop transitions, 55 changer transitions 40/246 dead transitions. [2022-12-06 04:08:08,393 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 246 transitions, 2507 flow [2022-12-06 04:08:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:08:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:08:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2022-12-06 04:08:08,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46875 [2022-12-06 04:08:08,395 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 692 flow. Second operand 8 states and 135 transitions. [2022-12-06 04:08:08,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 246 transitions, 2507 flow [2022-12-06 04:08:09,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 246 transitions, 2303 flow, removed 74 selfloop flow, removed 2 redundant places. [2022-12-06 04:08:09,143 INFO L231 Difference]: Finished difference. Result has 78 places, 102 transitions, 1060 flow [2022-12-06 04:08:09,144 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1060, PETRI_PLACES=78, PETRI_TRANSITIONS=102} [2022-12-06 04:08:09,144 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2022-12-06 04:08:09,144 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:09,144 INFO L89 Accepts]: Start accepts. Operand has 78 places, 102 transitions, 1060 flow [2022-12-06 04:08:09,145 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:09,145 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:09,146 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 102 transitions, 1060 flow [2022-12-06 04:08:09,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 102 transitions, 1060 flow [2022-12-06 04:08:09,445 INFO L130 PetriNetUnfolder]: 1499/2944 cut-off events. [2022-12-06 04:08:09,445 INFO L131 PetriNetUnfolder]: For 19028/20155 co-relation queries the response was YES. [2022-12-06 04:08:09,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14500 conditions, 2944 events. 1499/2944 cut-off events. For 19028/20155 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 21999 event pairs, 415 based on Foata normal form. 156/2930 useless extension candidates. Maximal degree in co-relation 14467. Up to 1242 conditions per place. [2022-12-06 04:08:09,477 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 102 transitions, 1060 flow [2022-12-06 04:08:09,477 INFO L188 LiptonReduction]: Number of co-enabled transitions 1162 [2022-12-06 04:08:09,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L786-->L789: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [614] $Ultimate##0-->L816: Formula: (and (= v_~y$w_buff0_used~0_243 1) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13| 0)) (= v_~y$r_buff0_thd0~0_107 v_~y$r_buff1_thd0~0_102) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_243 256) 0)) (not (= (mod v_~y$w_buff1_used~0_212 256) 0)))) 1 0)) (= v_~y$r_buff0_thd3~0_82 1) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|) (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_15) (= v_~y$r_buff0_thd3~0_83 v_~y$r_buff1_thd3~0_67) (= 2 v_~y$w_buff0~0_148) (= v_~y$r_buff0_thd2~0_33 v_~y$r_buff1_thd2~0_27) (= v_~y$w_buff0_used~0_244 v_~y$w_buff1_used~0_212) (= v_~y$r_buff0_thd4~0_45 v_~y$r_buff1_thd4~0_43) (= v_~y$w_buff1~0_139 v_~y$w_buff0~0_149) (= |v_P2Thread1of1ForFork0_~arg#1.base_7| |v_P2Thread1of1ForFork0_#in~arg#1.base_7|) (= |v_P2Thread1of1ForFork0_~arg#1.offset_7| |v_P2Thread1of1ForFork0_#in~arg#1.offset_7|)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_244, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_83, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_149, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_243, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_7|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_15, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_67, ~y$w_buff1~0=v_~y$w_buff1~0_139, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_107, ~y$w_buff0~0=v_~y$w_buff0~0_148, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_33, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_13|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_7|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_102, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_13|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_212} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:08:09,583 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [564] L786-->L789: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [583] L894-->L906: Formula: (let ((.cse6 (not (= (mod v_~y$r_buff1_thd4~0_30 256) 0))) (.cse9 (not (= (mod v_~z$w_buff0_used~0_135 256) 0))) (.cse8 (not (= (mod v_~z$r_buff1_thd4~0_66 256) 0))) (.cse7 (not (= (mod v_~y$w_buff0_used~0_175 256) 0))) (.cse10 (not (= (mod v_~y$r_buff0_thd4~0_32 256) 0))) (.cse11 (not (= (mod v_~z$r_buff0_thd4~0_81 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff0_used~0_136 256) 0)) .cse11)) (.cse4 (and .cse7 .cse10)) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_123 256) 0)) .cse8)) (.cse0 (and .cse9 .cse11)) (.cse3 (and (not (= (mod v_~y$w_buff0_used~0_176 256) 0)) .cse10)) (.cse5 (and (not (= (mod v_~y$w_buff1_used~0_153 256) 0)) .cse6))) (and (= v_~z$r_buff0_thd4~0_80 (ite .cse0 0 v_~z$r_buff0_thd4~0_81)) (= v_~z~0_100 (ite .cse1 v_~z$w_buff0~0_62 (ite .cse2 v_~z$w_buff1~0_73 v_~z~0_101))) (= (ite .cse1 0 v_~z$w_buff0_used~0_136) v_~z$w_buff0_used~0_135) (= v_~y$w_buff0_used~0_175 (ite .cse3 0 v_~y$w_buff0_used~0_176)) (= v_~y$r_buff0_thd4~0_31 (ite .cse4 0 v_~y$r_buff0_thd4~0_32)) (= v_~y$w_buff1_used~0_152 (ite (or .cse5 .cse4) 0 v_~y$w_buff1_used~0_153)) (= (ite (or (and .cse6 (not (= (mod v_~y$w_buff1_used~0_152 256) 0))) (and .cse7 (not (= (mod v_~y$r_buff0_thd4~0_31 256) 0)))) 0 v_~y$r_buff1_thd4~0_30) v_~y$r_buff1_thd4~0_29) (= v_~z$w_buff1_used~0_122 (ite (or .cse2 .cse0) 0 v_~z$w_buff1_used~0_123)) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_122 256) 0)) .cse8) (and .cse9 (not (= (mod v_~z$r_buff0_thd4~0_80 256) 0)))) 0 v_~z$r_buff1_thd4~0_66) v_~z$r_buff1_thd4~0_65) (= v_~y~0_135 (ite .cse3 v_~y$w_buff0~0_86 (ite .cse5 v_~y$w_buff1~0_85 v_~y~0_136)))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_66, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_176, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_136, ~z$w_buff0~0=v_~z$w_buff0~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_123, ~z$w_buff1~0=v_~z$w_buff1~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_30, ~y$w_buff1~0=v_~y$w_buff1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_81, ~z~0=v_~z~0_101, ~y~0=v_~y~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_153} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_65, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_175, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_135, ~z$w_buff0~0=v_~z$w_buff0~0_62, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_122, ~z$w_buff1~0=v_~z$w_buff1~0_73, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_31, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_29, ~y$w_buff1~0=v_~y$w_buff1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_86, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_80, ~z~0=v_~z~0_100, ~y~0=v_~y~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_152} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~z$r_buff1_thd4~0, ~y$w_buff0_used~0, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~z$r_buff0_thd4~0, ~z~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:08:10,269 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:08:10,270 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1126 [2022-12-06 04:08:10,270 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 102 transitions, 1074 flow [2022-12-06 04:08:10,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:10,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:10,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:10,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:08:10,270 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:08:10,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:10,271 INFO L85 PathProgramCache]: Analyzing trace with hash 369256370, now seen corresponding path program 1 times [2022-12-06 04:08:10,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:10,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723702816] [2022-12-06 04:08:10,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:10,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:10,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:10,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:10,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:10,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723702816] [2022-12-06 04:08:10,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723702816] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:10,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:10,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:08:10,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649843644] [2022-12-06 04:08:10,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:10,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:08:10,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:10,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:08:10,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:08:10,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 04:08:10,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 102 transitions, 1074 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:10,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:10,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 04:08:10,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:11,622 INFO L130 PetriNetUnfolder]: 4833/7585 cut-off events. [2022-12-06 04:08:11,623 INFO L131 PetriNetUnfolder]: For 47099/47787 co-relation queries the response was YES. [2022-12-06 04:08:11,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39599 conditions, 7585 events. 4833/7585 cut-off events. For 47099/47787 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 46146 event pairs, 614 based on Foata normal form. 340/7849 useless extension candidates. Maximal degree in co-relation 39563. Up to 3315 conditions per place. [2022-12-06 04:08:11,690 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 186 selfloop transitions, 13 changer transitions 3/219 dead transitions. [2022-12-06 04:08:11,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 219 transitions, 2659 flow [2022-12-06 04:08:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:08:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:08:11,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-06 04:08:11,691 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.572972972972973 [2022-12-06 04:08:11,691 INFO L175 Difference]: Start difference. First operand has 75 places, 102 transitions, 1074 flow. Second operand 5 states and 106 transitions. [2022-12-06 04:08:11,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 219 transitions, 2659 flow [2022-12-06 04:08:11,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 219 transitions, 2616 flow, removed 21 selfloop flow, removed 4 redundant places. [2022-12-06 04:08:11,783 INFO L231 Difference]: Finished difference. Result has 76 places, 104 transitions, 1085 flow [2022-12-06 04:08:11,783 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1085, PETRI_PLACES=76, PETRI_TRANSITIONS=104} [2022-12-06 04:08:11,784 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2022-12-06 04:08:11,784 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:11,784 INFO L89 Accepts]: Start accepts. Operand has 76 places, 104 transitions, 1085 flow [2022-12-06 04:08:11,785 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:11,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:11,786 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 104 transitions, 1085 flow [2022-12-06 04:08:11,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 104 transitions, 1085 flow [2022-12-06 04:08:12,096 INFO L130 PetriNetUnfolder]: 1538/3018 cut-off events. [2022-12-06 04:08:12,096 INFO L131 PetriNetUnfolder]: For 13474/14762 co-relation queries the response was YES. [2022-12-06 04:08:12,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14774 conditions, 3018 events. 1538/3018 cut-off events. For 13474/14762 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 22493 event pairs, 431 based on Foata normal form. 133/3003 useless extension candidates. Maximal degree in co-relation 14742. Up to 1311 conditions per place. [2022-12-06 04:08:12,127 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 104 transitions, 1085 flow [2022-12-06 04:08:12,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 1168 [2022-12-06 04:08:12,132 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:08:12,133 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 349 [2022-12-06 04:08:12,133 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 104 transitions, 1085 flow [2022-12-06 04:08:12,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:12,133 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:12,133 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:12,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:08:12,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:08:12,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:12,134 INFO L85 PathProgramCache]: Analyzing trace with hash -449324409, now seen corresponding path program 1 times [2022-12-06 04:08:12,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:12,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210215987] [2022-12-06 04:08:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:12,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:12,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:12,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210215987] [2022-12-06 04:08:12,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210215987] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:12,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:12,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:08:12,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351004682] [2022-12-06 04:08:12,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:12,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:08:12,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:12,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:08:12,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:08:12,335 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 04:08:12,335 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 104 transitions, 1085 flow. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:12,335 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:12,335 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 04:08:12,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:13,329 INFO L130 PetriNetUnfolder]: 4129/6530 cut-off events. [2022-12-06 04:08:13,330 INFO L131 PetriNetUnfolder]: For 38383/39205 co-relation queries the response was YES. [2022-12-06 04:08:13,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33600 conditions, 6530 events. 4129/6530 cut-off events. For 38383/39205 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 39658 event pairs, 577 based on Foata normal form. 711/7147 useless extension candidates. Maximal degree in co-relation 33565. Up to 2612 conditions per place. [2022-12-06 04:08:13,366 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 185 selfloop transitions, 17 changer transitions 63/282 dead transitions. [2022-12-06 04:08:13,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 282 transitions, 3459 flow [2022-12-06 04:08:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:08:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:08:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-12-06 04:08:13,368 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.563265306122449 [2022-12-06 04:08:13,368 INFO L175 Difference]: Start difference. First operand has 76 places, 104 transitions, 1085 flow. Second operand 7 states and 138 transitions. [2022-12-06 04:08:13,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 282 transitions, 3459 flow [2022-12-06 04:08:13,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 282 transitions, 3421 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 04:08:13,493 INFO L231 Difference]: Finished difference. Result has 82 places, 108 transitions, 1149 flow [2022-12-06 04:08:13,494 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1149, PETRI_PLACES=82, PETRI_TRANSITIONS=108} [2022-12-06 04:08:13,494 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2022-12-06 04:08:13,494 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:13,494 INFO L89 Accepts]: Start accepts. Operand has 82 places, 108 transitions, 1149 flow [2022-12-06 04:08:13,495 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:13,496 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:13,496 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 108 transitions, 1149 flow [2022-12-06 04:08:13,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 108 transitions, 1149 flow [2022-12-06 04:08:13,691 INFO L130 PetriNetUnfolder]: 934/2113 cut-off events. [2022-12-06 04:08:13,691 INFO L131 PetriNetUnfolder]: For 9808/10939 co-relation queries the response was YES. [2022-12-06 04:08:13,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10700 conditions, 2113 events. 934/2113 cut-off events. For 9808/10939 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 16606 event pairs, 156 based on Foata normal form. 145/2179 useless extension candidates. Maximal degree in co-relation 10665. Up to 1072 conditions per place. [2022-12-06 04:08:13,714 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 108 transitions, 1149 flow [2022-12-06 04:08:13,715 INFO L188 LiptonReduction]: Number of co-enabled transitions 1358 [2022-12-06 04:08:13,727 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] L930-3-->L934: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_131 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_25|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [663] L774-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_88 1) v_~__unbuffered_cnt~0_87)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:08:13,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] L930-3-->L934: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_131 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_25|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [616] L855-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P2Thread1of1ForFork0_#res#1.base_9| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_9|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-06 04:08:13,772 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [722] L930-3-->L934: Formula: (and (= v_~main$tmp_guard0~0_36 (ite (= (ite (= v_~__unbuffered_cnt~0_131 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_36 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_25|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [687] L796-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.base_15| 0) (= (+ v_~__unbuffered_cnt~0_114 1) v_~__unbuffered_cnt~0_113) (= |v_P1Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_15|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-06 04:08:13,821 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:08:13,822 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 328 [2022-12-06 04:08:13,822 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 107 transitions, 1151 flow [2022-12-06 04:08:13,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:13,822 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:13,822 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:08:13,822 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:08:13,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash -716443675, now seen corresponding path program 1 times [2022-12-06 04:08:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:13,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051099090] [2022-12-06 04:08:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:14,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:14,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051099090] [2022-12-06 04:08:14,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051099090] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:14,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:14,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 04:08:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214616062] [2022-12-06 04:08:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:14,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:08:14,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:14,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:08:14,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:08:14,089 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2022-12-06 04:08:14,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 107 transitions, 1151 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:14,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:14,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2022-12-06 04:08:14,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:14,899 INFO L130 PetriNetUnfolder]: 3580/5596 cut-off events. [2022-12-06 04:08:14,900 INFO L131 PetriNetUnfolder]: For 33015/33410 co-relation queries the response was YES. [2022-12-06 04:08:14,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29879 conditions, 5596 events. 3580/5596 cut-off events. For 33015/33410 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 32629 event pairs, 575 based on Foata normal form. 335/5892 useless extension candidates. Maximal degree in co-relation 29841. Up to 2203 conditions per place. [2022-12-06 04:08:14,929 INFO L137 encePairwiseOnDemand]: 28/38 looper letters, 141 selfloop transitions, 17 changer transitions 75/246 dead transitions. [2022-12-06 04:08:14,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 246 transitions, 3018 flow [2022-12-06 04:08:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 04:08:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 04:08:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2022-12-06 04:08:14,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4276315789473684 [2022-12-06 04:08:14,932 INFO L175 Difference]: Start difference. First operand has 81 places, 107 transitions, 1151 flow. Second operand 8 states and 130 transitions. [2022-12-06 04:08:14,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 246 transitions, 3018 flow [2022-12-06 04:08:15,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 246 transitions, 2882 flow, removed 35 selfloop flow, removed 7 redundant places. [2022-12-06 04:08:15,128 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 849 flow [2022-12-06 04:08:15,129 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=849, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2022-12-06 04:08:15,129 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2022-12-06 04:08:15,129 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:15,129 INFO L89 Accepts]: Start accepts. Operand has 84 places, 83 transitions, 849 flow [2022-12-06 04:08:15,130 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:15,130 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:15,130 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 83 transitions, 849 flow [2022-12-06 04:08:15,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 83 transitions, 849 flow [2022-12-06 04:08:15,202 INFO L130 PetriNetUnfolder]: 370/789 cut-off events. [2022-12-06 04:08:15,202 INFO L131 PetriNetUnfolder]: For 2934/3153 co-relation queries the response was YES. [2022-12-06 04:08:15,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 789 events. 370/789 cut-off events. For 2934/3153 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4784 event pairs, 97 based on Foata normal form. 1/762 useless extension candidates. Maximal degree in co-relation 3559. Up to 323 conditions per place. [2022-12-06 04:08:15,210 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 83 transitions, 849 flow [2022-12-06 04:08:15,210 INFO L188 LiptonReduction]: Number of co-enabled transitions 766 [2022-12-06 04:08:41,373 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:08:41,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26245 [2022-12-06 04:08:41,374 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 845 flow [2022-12-06 04:08:41,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:41,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:41,374 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:41,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:08:41,374 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:08:41,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1112090565, now seen corresponding path program 1 times [2022-12-06 04:08:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:41,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430549323] [2022-12-06 04:08:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:08:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:08:41,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:08:41,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430549323] [2022-12-06 04:08:41,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430549323] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:08:41,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:08:41,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:08:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116641022] [2022-12-06 04:08:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:08:41,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:08:41,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:08:41,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:08:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:08:41,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 04:08:41,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 845 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:41,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:08:41,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 04:08:41,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:08:42,131 INFO L130 PetriNetUnfolder]: 2911/4563 cut-off events. [2022-12-06 04:08:42,132 INFO L131 PetriNetUnfolder]: For 24095/24149 co-relation queries the response was YES. [2022-12-06 04:08:42,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23144 conditions, 4563 events. 2911/4563 cut-off events. For 24095/24149 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 25667 event pairs, 602 based on Foata normal form. 22/4582 useless extension candidates. Maximal degree in co-relation 23106. Up to 2721 conditions per place. [2022-12-06 04:08:42,152 INFO L137 encePairwiseOnDemand]: 27/30 looper letters, 72 selfloop transitions, 1 changer transitions 85/164 dead transitions. [2022-12-06 04:08:42,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 164 transitions, 1958 flow [2022-12-06 04:08:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:08:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:08:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 04:08:42,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 04:08:42,154 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 845 flow. Second operand 4 states and 72 transitions. [2022-12-06 04:08:42,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 164 transitions, 1958 flow [2022-12-06 04:08:42,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 164 transitions, 1747 flow, removed 36 selfloop flow, removed 10 redundant places. [2022-12-06 04:08:42,263 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 611 flow [2022-12-06 04:08:42,263 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=611, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2022-12-06 04:08:42,264 INFO L294 CegarLoopForPetriNet]: 47 programPoint places, 26 predicate places. [2022-12-06 04:08:42,264 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:08:42,264 INFO L89 Accepts]: Start accepts. Operand has 73 places, 69 transitions, 611 flow [2022-12-06 04:08:42,265 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:08:42,265 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:08:42,265 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 69 transitions, 611 flow [2022-12-06 04:08:42,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 69 transitions, 611 flow [2022-12-06 04:08:42,316 INFO L130 PetriNetUnfolder]: 283/656 cut-off events. [2022-12-06 04:08:42,316 INFO L131 PetriNetUnfolder]: For 3023/3137 co-relation queries the response was YES. [2022-12-06 04:08:42,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2502 conditions, 656 events. 283/656 cut-off events. For 3023/3137 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4082 event pairs, 69 based on Foata normal form. 53/684 useless extension candidates. Maximal degree in co-relation 2472. Up to 233 conditions per place. [2022-12-06 04:08:42,320 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 69 transitions, 611 flow [2022-12-06 04:08:42,320 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-06 04:08:42,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [649] $Ultimate##0-->L771: Formula: (and (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= v_~a~0_9 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_9, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_~arg.base] and [731] $Ultimate##0-->L774: Formula: (and (= |v_P2Thread1of1ForFork0_~arg#1.offset_35| |v_P2Thread1of1ForFork0_#in~arg#1.offset_35|) (= v_~y$w_buff0_used~0_694 1) (= v_~y$r_buff0_thd1~0_55 v_~y$r_buff1_thd1~0_53) (= v_~x~0_138 1) (= v_~y$r_buff0_thd0~0_402 v_~y$r_buff1_thd0~0_396) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_35| |v_P2Thread1of1ForFork0_~arg#1.base_35|) (= v_~y$w_buff1~0_434 v_~y$w_buff0~0_464) (= 2 v_~y$w_buff0~0_463) (= v_~y$w_buff0_used~0_695 v_~y$w_buff1_used~0_645) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_41|) (= v_~y$r_buff0_thd4~0_115 v_~y$r_buff1_thd4~0_110) (= v_~y$r_buff0_thd2~0_105 v_~y$r_buff1_thd2~0_102) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_41| 0)) (= v_~y$r_buff0_thd3~0_241 v_~y$r_buff1_thd3~0_201) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_645 256) 0)) (not (= (mod v_~y$w_buff0_used~0_694 256) 0)))) 1 0)) (= v_~y$r_buff0_thd3~0_240 1)) InVars {P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_35|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_115, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_695, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_35|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_241, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_402, ~y$w_buff0~0=v_~y$w_buff0~0_464, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_55} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_694, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_35|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_102, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_35|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_115, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_53, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_110, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_201, ~y$w_buff1~0=v_~y$w_buff1~0_434, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_35|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_240, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_402, ~y$w_buff0~0=v_~y$w_buff0~0_463, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_55, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_41|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_35|, ~x~0=v_~x~0_138, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_396, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_41|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_645} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~x~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:08:42,644 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [582] L891-->L894: Formula: (= v_~__unbuffered_p3_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p3_EBX~0] and [734] $Ultimate##0-->L906: Formula: (let ((.cse1 (not (= (mod v_~z$r_buff1_thd4~0_185 256) 0))) (.cse0 (not (= (mod v_~z$w_buff0_used~0_456 256) 0))) (.cse10 (not (= (mod v_~z$r_buff0_thd4~0_217 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_710 256) 0)) (.cse7 (not (= (mod v_~y$r_buff0_thd4~0_122 256) 0))) (.cse6 (not (= (mod v_~y$w_buff0_used~0_708 256) 0)))) (let ((.cse8 (and .cse7 .cse6)) (.cse9 (and .cse7 (not .cse3))) (.cse5 (and .cse0 .cse10)) (.cse2 (and (not (= (mod v_~z$w_buff0_used~0_457 256) 0)) .cse10)) (.cse4 (and .cse1 (not (= 0 (mod v_~z$w_buff1_used~0_422 256)))))) (and (= 2 v_~y$w_buff0~0_477) (= v_~y$w_buff1~0_442 v_~y$w_buff0~0_478) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_47| |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_47|) (= (ite (or (and (not (= (mod v_~z$r_buff0_thd4~0_216 256) 0)) .cse0) (and (not (= (mod v_~z$w_buff1_used~0_421 256) 0)) .cse1)) 0 v_~z$r_buff1_thd4~0_185) v_~z$r_buff1_thd4~0_184) (= v_~z$w_buff0_used~0_456 (ite .cse2 0 v_~z$w_buff0_used~0_457)) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_47| (ite .cse3 1 0)) (= v_~y$r_buff0_thd3~0_255 v_~y$r_buff1_thd3~0_209) (= v_~z$w_buff1_used~0_421 (ite (or .cse4 .cse5) 0 v_~z$w_buff1_used~0_422)) (= v_~y$r_buff0_thd0~0_408 v_~y$r_buff1_thd0~0_402) (= v_~y$r_buff0_thd1~0_61 v_~y$r_buff1_thd1~0_59) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_121 256) 0)) .cse6) (and .cse7 (not (= (mod v_~y$w_buff1_used~0_653 256) 0)))) 0 v_~y$r_buff0_thd4~0_122) v_~y$r_buff1_thd4~0_116) (= v_~y$r_buff0_thd3~0_254 1) (= (ite .cse8 0 v_~y$r_buff0_thd4~0_122) v_~y$r_buff0_thd4~0_121) (= v_~y$w_buff1_used~0_653 (ite (or .cse9 .cse8) 0 v_~y$w_buff0_used~0_710)) (= |v_P2Thread1of1ForFork0_#in~arg#1.base_41| |v_P2Thread1of1ForFork0_~arg#1.base_41|) (= v_~y$w_buff0_used~0_708 (ite .cse7 0 1)) (= |v_P2Thread1of1ForFork0_~arg#1.offset_41| |v_P2Thread1of1ForFork0_#in~arg#1.offset_41|) (= v_~y~0_643 (ite .cse7 v_~y$w_buff0~0_477 (ite .cse9 v_~y$w_buff1~0_442 v_~y~0_644))) (= v_~y$r_buff0_thd2~0_111 v_~y$r_buff1_thd2~0_108) (= (ite .cse5 0 v_~z$r_buff0_thd4~0_217) v_~z$r_buff0_thd4~0_216) (= v_~z~0_381 (ite .cse2 v_~z$w_buff0~0_282 (ite .cse4 v_~z$w_buff1~0_265 v_~z~0_382))) (not (= |v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_47| 0))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_185, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_710, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_457, ~z$w_buff0~0=v_~z$w_buff0~0_282, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_422, ~z$w_buff1~0=v_~z$w_buff1~0_265, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_41|, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_122, ~y$w_buff0~0=v_~y$w_buff0~0_478, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_255, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_408, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_111, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_217, ~z~0=v_~z~0_382, ~y~0=v_~y~0_644} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_184, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_708, ~z$w_buff1~0=v_~z$w_buff1~0_265, P2Thread1of1ForFork0_#in~arg#1.base=|v_P2Thread1of1ForFork0_#in~arg#1.base_41|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_59, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_209, P2Thread1of1ForFork0_~arg#1.base=|v_P2Thread1of1ForFork0_~arg#1.base_41|, ~y$w_buff0~0=v_~y$w_buff0~0_477, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_254, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_61, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_216, ~y~0=v_~y~0_643, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_456, ~z$w_buff0~0=v_~z$w_buff0~0_282, P2Thread1of1ForFork0_#in~arg#1.offset=|v_P2Thread1of1ForFork0_#in~arg#1.offset_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_421, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_108, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_121, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_116, ~y$w_buff1~0=v_~y$w_buff1~0_442, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_408, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_111, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_~expression#1_47|, P2Thread1of1ForFork0_~arg#1.offset=|v_P2Thread1of1ForFork0_~arg#1.offset_41|, ~z~0=v_~z~0_381, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_402, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_47|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_653} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~y$w_buff0_used~0, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, P2Thread1of1ForFork0_~arg#1.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~z$r_buff0_thd4~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression#1, P2Thread1of1ForFork0_~arg#1.offset, ~z~0, ~y~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:08:42,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [752] $Ultimate##0-->L774: Formula: (and (= v_~a~0_43 1) (= v_P0Thread1of1ForFork1_~arg.offset_23 |v_P0Thread1of1ForFork1_#in~arg.offset_23|) (= v_~x~0_160 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_23| v_P0Thread1of1ForFork1_~arg.base_23)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|} OutVars{~a~0=v_~a~0_43, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_23|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_23, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_23|, ~x~0=v_~x~0_160, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_23} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_~arg.offset, ~x~0, P0Thread1of1ForFork1_~arg.base] and [675] $Ultimate##0-->L786: Formula: (and (= v_P1Thread1of1ForFork3_~arg.offset_5 |v_P1Thread1of1ForFork3_#in~arg.offset_5|) (= v_P1Thread1of1ForFork3_~arg.base_5 |v_P1Thread1of1ForFork3_#in~arg.base_5|) (= v_~x~0_53 2)) InVars {P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork3_~arg.offset=v_P1Thread1of1ForFork3_~arg.offset_5, P1Thread1of1ForFork3_#in~arg.base=|v_P1Thread1of1ForFork3_#in~arg.base_5|, P1Thread1of1ForFork3_~arg.base=v_P1Thread1of1ForFork3_~arg.base_5, P1Thread1of1ForFork3_#in~arg.offset=|v_P1Thread1of1ForFork3_#in~arg.offset_5|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork3_~arg.offset, P1Thread1of1ForFork3_~arg.base, ~x~0] [2022-12-06 04:08:42,950 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:08:42,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 687 [2022-12-06 04:08:42,951 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 643 flow [2022-12-06 04:08:42,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:08:42,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:08:42,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:42,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:08:42,951 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2022-12-06 04:08:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:08:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash 447621668, now seen corresponding path program 1 times [2022-12-06 04:08:42,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:08:42,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192153073] [2022-12-06 04:08:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:08:42,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:08:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:08:43,000 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:08:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:08:43,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:08:43,132 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:08:43,132 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2022-12-06 04:08:43,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2022-12-06 04:08:43,134 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2022-12-06 04:08:43,136 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2022-12-06 04:08:43,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2022-12-06 04:08:43,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2022-12-06 04:08:43,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2022-12-06 04:08:43,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2022-12-06 04:08:43,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2022-12-06 04:08:43,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:08:43,138 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:08:43,142 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:08:43,142 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:08:43,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:08:43 BasicIcfg [2022-12-06 04:08:43,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:08:43,243 INFO L158 Benchmark]: Toolchain (without parser) took 62094.88ms. Allocated memory was 183.5MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 158.6MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 963.2MB. Max. memory is 8.0GB. [2022-12-06 04:08:43,244 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:08:43,244 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.87ms. Allocated memory is still 183.5MB. Free memory was 158.3MB in the beginning and 125.3MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-06 04:08:43,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.81ms. Allocated memory is still 183.5MB. Free memory was 124.8MB in the beginning and 121.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-06 04:08:43,244 INFO L158 Benchmark]: Boogie Preprocessor took 26.38ms. Allocated memory is still 183.5MB. Free memory was 121.1MB in the beginning and 118.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:08:43,244 INFO L158 Benchmark]: RCFGBuilder took 863.43ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 118.5MB in the beginning and 185.5MB in the end (delta: -67.0MB). Peak memory consumption was 68.3MB. Max. memory is 8.0GB. [2022-12-06 04:08:43,244 INFO L158 Benchmark]: TraceAbstraction took 60631.96ms. Allocated memory was 220.2MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 184.4MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 951.5MB. Max. memory is 8.0GB. [2022-12-06 04:08:43,246 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 160.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 492.87ms. Allocated memory is still 183.5MB. Free memory was 158.3MB in the beginning and 125.3MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.81ms. Allocated memory is still 183.5MB. Free memory was 124.8MB in the beginning and 121.1MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.38ms. Allocated memory is still 183.5MB. Free memory was 121.1MB in the beginning and 118.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 863.43ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 118.5MB in the beginning and 185.5MB in the end (delta: -67.0MB). Peak memory consumption was 68.3MB. Max. memory is 8.0GB. * TraceAbstraction took 60631.96ms. Allocated memory was 220.2MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 184.4MB in the beginning and 2.1GB in the end (delta: -1.9GB). Peak memory consumption was 951.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3s, 157 PlacesBefore, 47 PlacesAfterwards, 146 TransitionsBefore, 35 TransitionsAfterwards, 3210 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 61 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2395, independent: 2320, independent conditional: 2320, independent unconditional: 0, dependent: 75, dependent conditional: 75, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2395, independent: 2320, independent conditional: 0, independent unconditional: 2320, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2395, independent: 2320, independent conditional: 0, independent unconditional: 2320, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2395, independent: 2320, independent conditional: 0, independent unconditional: 2320, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1929, independent: 1868, independent conditional: 0, independent unconditional: 1868, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1929, independent: 1839, independent conditional: 0, independent unconditional: 1839, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 465, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 425, dependent conditional: 0, dependent unconditional: 425, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2395, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1929, unknown conditional: 0, unknown unconditional: 1929] , Statistics on independence cache: Total cache size (in pairs): 2973, Positive cache size: 2912, Positive conditional cache size: 0, Positive unconditional cache size: 2912, Negative cache size: 61, Negative conditional cache size: 0, Negative unconditional cache size: 61, 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.2s, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 506 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 222, independent: 190, independent conditional: 190, 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: 222, independent: 190, independent conditional: 14, independent unconditional: 176, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 222, independent: 190, independent conditional: 14, independent unconditional: 176, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 222, independent: 190, independent conditional: 14, independent unconditional: 176, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 196, independent: 171, independent conditional: 12, independent unconditional: 159, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 196, independent: 164, independent conditional: 0, independent unconditional: 164, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 156, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 146, dependent conditional: 10, dependent unconditional: 136, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 222, independent: 19, independent conditional: 2, independent unconditional: 17, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 196, unknown conditional: 14, unknown unconditional: 182] , Statistics on independence cache: Total cache size (in pairs): 196, Positive cache size: 171, Positive conditional cache size: 12, Positive unconditional cache size: 159, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 209, independent: 179, independent conditional: 179, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 209, independent: 179, independent conditional: 14, independent unconditional: 165, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 209, independent: 179, independent conditional: 14, independent unconditional: 165, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 209, independent: 179, independent conditional: 14, independent unconditional: 165, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 1, independent unconditional: 11, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 13, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 209, independent: 167, independent conditional: 13, independent unconditional: 154, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 16, unknown conditional: 3, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 183, Positive conditional cache size: 13, Positive unconditional cache size: 170, Negative cache size: 29, Negative conditional cache size: 4, Negative unconditional cache size: 25, 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, 43 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 448 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 184, independent: 170, independent conditional: 170, 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: 184, independent: 170, independent conditional: 21, independent unconditional: 149, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 184, independent: 170, independent conditional: 7, independent unconditional: 163, 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: 184, independent: 170, independent conditional: 7, independent unconditional: 163, 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: 9, independent: 8, independent conditional: 1, independent unconditional: 7, 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: 9, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 184, independent: 162, independent conditional: 6, independent unconditional: 156, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 9, unknown conditional: 1, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 221, Positive cache size: 191, Positive conditional cache size: 14, Positive unconditional cache size: 177, Negative cache size: 30, Negative conditional cache size: 4, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 377, independent: 351, independent conditional: 351, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 377, independent: 351, independent conditional: 117, independent unconditional: 234, dependent: 26, dependent conditional: 11, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 377, independent: 351, independent conditional: 58, independent unconditional: 293, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 377, independent: 351, independent conditional: 58, independent unconditional: 293, dependent: 26, dependent conditional: 6, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 22, dependent conditional: 18, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 377, independent: 345, independent conditional: 58, independent unconditional: 287, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 231, Positive cache size: 197, Positive conditional cache size: 14, Positive unconditional cache size: 183, Negative cache size: 34, Negative conditional cache size: 7, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 58 PlacesBefore, 58 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 560, independent: 519, independent conditional: 519, independent unconditional: 0, dependent: 41, dependent conditional: 41, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 560, independent: 519, independent conditional: 208, independent unconditional: 311, dependent: 41, dependent conditional: 12, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 569, independent: 519, independent conditional: 119, independent unconditional: 400, dependent: 50, dependent conditional: 20, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 569, independent: 519, independent conditional: 119, independent unconditional: 400, dependent: 50, dependent conditional: 20, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 6, independent unconditional: 5, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 569, independent: 508, independent conditional: 113, independent unconditional: 395, dependent: 45, dependent conditional: 15, dependent unconditional: 30, unknown: 16, unknown conditional: 11, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 247, Positive cache size: 208, Positive conditional cache size: 20, Positive unconditional cache size: 188, Negative cache size: 39, Negative conditional cache size: 12, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 64 PlacesBefore, 62 PlacesAfterwards, 74 TransitionsBefore, 72 TransitionsAfterwards, 902 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 917, independent: 875, independent conditional: 875, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 917, independent: 875, independent conditional: 503, independent unconditional: 372, dependent: 42, dependent conditional: 16, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 933, independent: 875, independent conditional: 382, independent unconditional: 493, dependent: 58, dependent conditional: 32, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 933, independent: 875, independent conditional: 382, independent unconditional: 493, dependent: 58, dependent conditional: 32, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 24, independent conditional: 21, independent unconditional: 3, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 933, independent: 851, independent conditional: 361, independent unconditional: 490, dependent: 54, dependent conditional: 28, dependent unconditional: 26, unknown: 28, unknown conditional: 25, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 314, Positive cache size: 271, Positive conditional cache size: 41, Positive unconditional cache size: 230, Negative cache size: 43, Negative conditional cache size: 16, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 121, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 68 PlacesBefore, 68 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 331, independent: 312, independent conditional: 312, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 331, independent: 312, independent conditional: 134, independent unconditional: 178, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 337, independent: 312, independent conditional: 89, independent unconditional: 223, dependent: 25, dependent conditional: 12, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 337, independent: 312, independent conditional: 89, independent unconditional: 223, dependent: 25, dependent conditional: 12, dependent unconditional: 13, 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: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 337, independent: 312, independent conditional: 89, independent unconditional: 223, dependent: 24, dependent conditional: 12, dependent unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 271, Positive conditional cache size: 41, Positive unconditional cache size: 230, Negative cache size: 44, Negative conditional cache size: 16, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 45, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 75 PlacesBefore, 75 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 1162 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1063, independent: 1033, independent conditional: 1033, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1063, independent: 1033, independent conditional: 797, independent unconditional: 236, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1063, independent: 1033, independent conditional: 521, independent unconditional: 512, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1063, independent: 1033, independent conditional: 521, independent unconditional: 512, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 15, independent unconditional: 9, 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: 24, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 1063, independent: 1009, independent conditional: 506, independent unconditional: 503, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 24, unknown conditional: 15, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 320, Positive conditional cache size: 58, Positive unconditional cache size: 262, Negative cache size: 44, Negative conditional cache size: 16, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 276, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 76 PlacesBefore, 76 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 1168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 460, independent: 445, independent conditional: 445, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 460, independent: 445, independent conditional: 340, independent unconditional: 105, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 460, independent: 445, independent conditional: 245, independent unconditional: 200, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 460, independent: 445, independent conditional: 245, independent unconditional: 200, dependent: 15, dependent conditional: 0, dependent unconditional: 15, 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: 460, independent: 445, independent conditional: 245, independent unconditional: 200, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 364, Positive cache size: 320, Positive conditional cache size: 58, Positive unconditional cache size: 262, Negative cache size: 44, Negative conditional cache size: 16, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 95, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 82 PlacesBefore, 81 PlacesAfterwards, 108 TransitionsBefore, 107 TransitionsAfterwards, 1358 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1049, independent: 1019, independent conditional: 1019, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1049, independent: 1019, independent conditional: 809, independent unconditional: 210, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1049, independent: 1019, independent conditional: 601, independent unconditional: 418, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1049, independent: 1019, independent conditional: 601, independent unconditional: 418, dependent: 30, dependent conditional: 0, dependent unconditional: 30, 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: 1049, independent: 1016, independent conditional: 598, independent unconditional: 418, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 381, Positive cache size: 337, Positive conditional cache size: 61, Positive unconditional cache size: 276, Negative cache size: 44, Negative conditional cache size: 16, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 208, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.2s, 80 PlacesBefore, 78 PlacesAfterwards, 83 TransitionsBefore, 81 TransitionsAfterwards, 766 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 584, independent: 560, independent conditional: 560, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 584, independent: 560, independent conditional: 392, independent unconditional: 168, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 584, independent: 560, independent conditional: 296, independent unconditional: 264, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 584, independent: 560, independent conditional: 296, independent unconditional: 264, dependent: 24, dependent conditional: 0, dependent unconditional: 24, 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: 584, independent: 560, independent conditional: 296, independent unconditional: 264, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 387, Positive cache size: 343, Positive conditional cache size: 61, Positive unconditional cache size: 282, Negative cache size: 44, Negative conditional cache size: 16, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 96, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 72 PlacesBefore, 71 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 243, independent: 239, independent conditional: 239, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 243, independent: 239, independent conditional: 178, independent unconditional: 61, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 243, independent: 239, independent conditional: 138, independent unconditional: 101, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 243, independent: 239, independent conditional: 138, independent unconditional: 101, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 3, 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: 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: 243, independent: 233, independent conditional: 135, independent unconditional: 98, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 6, unknown conditional: 3, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 563, Positive cache size: 519, Positive conditional cache size: 70, Positive unconditional cache size: 449, Negative cache size: 44, Negative conditional cache size: 16, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L923] 0 pthread_t t233; [L924] FCALL, FORK 0 pthread_create(&t233, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t233, ((void *)0), P0, ((void *)0))=-3, t233={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L925] 0 pthread_t t234; [L926] FCALL, FORK 0 pthread_create(&t234, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t234, ((void *)0), P1, ((void *)0))=-2, t233={5:0}, t234={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L927] 0 pthread_t t235; [L928] FCALL, FORK 0 pthread_create(&t235, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t235, ((void *)0), P2, ((void *)0))=-1, t233={5:0}, t234={6:0}, t235={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L929] 0 pthread_t t236; [L805] 3 y$w_buff1 = y$w_buff0 [L806] 3 y$w_buff0 = 2 [L807] 3 y$w_buff1_used = y$w_buff0_used [L808] 3 y$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L810] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L811] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L812] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L813] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L814] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L815] 3 y$r_buff0_thd3 = (_Bool)1 [L818] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 3 y$flush_delayed = weak$$choice2 [L821] 3 y$mem_tmp = y [L822] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L823] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L824] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L825] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L826] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L828] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L829] 3 __unbuffered_p2_EAX = y [L830] 3 y = y$flush_delayed ? y$mem_tmp : y [L831] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L930] FCALL, FORK 0 pthread_create(&t236, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t236, ((void *)0), P3, ((void *)0))=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice0=4, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 3 z$flush_delayed = weak$$choice2 [L837] 3 z$mem_tmp = z [L838] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L839] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L840] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L841] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L842] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L843] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L844] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L845] 3 __unbuffered_p2_EBX = z [L846] 3 z = z$flush_delayed ? z$mem_tmp : z [L847] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 4 z$w_buff1 = z$w_buff0 [L865] 4 z$w_buff0 = 1 [L866] 4 z$w_buff1_used = z$w_buff0_used [L867] 4 z$w_buff0_used = (_Bool)1 [L868] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L868] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L869] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L870] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L871] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L872] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L873] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L874] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L877] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L878] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L879] 4 z$flush_delayed = weak$$choice2 [L880] 4 z$mem_tmp = z [L881] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L882] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L883] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L884] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L885] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L886] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L887] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L888] 4 __unbuffered_p3_EAX = z [L889] 4 z = z$flush_delayed ? z$mem_tmp : z [L890] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L893] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 1 a = 1 [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L896] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L897] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L898] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L899] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L900] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L901] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L902] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L903] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L904] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L905] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L850] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L851] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L852] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L854] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L859] 3 return 0; [L908] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L910] 4 return 0; [L932] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L934] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L934] RET 0 assume_abort_if_not(main$tmp_guard0) [L936] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L937] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L938] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L939] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L940] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L941] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L942] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L943] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L944] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L945] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L948] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L949] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L950] 0 y$flush_delayed = weak$$choice2 [L951] 0 y$mem_tmp = y [L952] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L953] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L954] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L955] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L956] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L957] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L958] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L959] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L960] 0 y = y$flush_delayed ? y$mem_tmp : y [L961] 0 y$flush_delayed = (_Bool)0 [L963] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 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: 928]: 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: 926]: 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: 924]: 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: 930]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 188 locations, 9 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: 60.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 715 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1457 IncrementalHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 22 mSDtfsCounter, 1457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1151occurred in iteration=10, InterpolantAutomatonStates: 63, 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.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:08:43,302 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...