/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:02:06,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:02:06,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:02:06,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:02:06,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:02:06,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:02:06,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:02:06,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:02:06,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:02:06,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:02:06,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:02:06,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:02:06,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:02:06,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:02:06,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:02:06,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:02:06,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:02:06,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:02:06,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:02:06,523 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:02:06,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:02:06,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:02:06,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:02:06,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:02:06,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:02:06,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:02:06,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:02:06,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:02:06,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:02:06,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:02:06,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:02:06,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:02:06,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:02:06,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:02:06,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:02:06,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:02:06,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:02:06,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:02:06,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:02:06,560 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:02:06,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:02:06,561 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:02:06,606 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:02:06,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:02:06,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:02:06,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:02:06,608 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:02:06,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:02:06,608 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:02:06,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:02:06,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:02:06,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:02:06,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:02:06,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:02:06,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:02:06,610 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:02:06,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:02:06,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:02:06,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:02:06,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:02:06,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:02:06,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:02:06,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:02:06,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:02:06,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:02:06,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:02:06,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:02:06,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:02:06,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:02:06,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:02:06,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-13 12:02:07,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:02:07,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:02:07,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:02:07,083 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:02:07,083 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:02:07,084 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2022-12-13 12:02:08,473 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:02:08,898 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:02:08,898 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2022-12-13 12:02:08,931 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089251924/8f617c59c4674bbcb2b241802a5d236f/FLAG9dcc4489e [2022-12-13 12:02:08,977 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/089251924/8f617c59c4674bbcb2b241802a5d236f [2022-12-13 12:02:08,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:02:08,980 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:02:08,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:02:08,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:02:08,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:02:08,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:02:08" (1/1) ... [2022-12-13 12:02:08,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6f0fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:08, skipping insertion in model container [2022-12-13 12:02:08,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:02:08" (1/1) ... [2022-12-13 12:02:09,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:02:09,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:02:09,318 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/safe016_power.oepc.i[995,1008] [2022-12-13 12:02:09,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:02:09,534 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:02:09,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/safe016_power.oepc.i[995,1008] [2022-12-13 12:02:09,554 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,562 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,563 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,564 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,568 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:02:09,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:02:09,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:02:09,602 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:02:09,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09 WrapperNode [2022-12-13 12:02:09,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:02:09,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:02:09,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:02:09,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:02:09,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,641 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2022-12-13 12:02:09,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:02:09,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:02:09,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:02:09,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:02:09,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,674 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:02:09,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:02:09,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:02:09,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:02:09,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (1/1) ... [2022-12-13 12:02:09,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:02:09,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:02:09,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:02:09,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:02:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:02:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:02:09,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:02:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:02:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:02:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:02:09,777 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 12:02:09,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 12:02:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 12:02:09,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 12:02:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 12:02:09,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 12:02:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 12:02:09,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 12:02:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:02:09,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:02:09,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:02:09,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:02:09,781 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:02:09,889 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:02:09,890 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:02:10,272 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:02:10,743 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:02:10,743 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:02:10,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:02:10 BoogieIcfgContainer [2022-12-13 12:02:10,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:02:10,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:02:10,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:02:10,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:02:10,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:02:08" (1/3) ... [2022-12-13 12:02:10,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15be12d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:02:10, skipping insertion in model container [2022-12-13 12:02:10,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:02:09" (2/3) ... [2022-12-13 12:02:10,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15be12d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:02:10, skipping insertion in model container [2022-12-13 12:02:10,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:02:10" (3/3) ... [2022-12-13 12:02:10,752 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2022-12-13 12:02:10,767 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:02:10,768 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:02:10,768 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:02:10,844 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 12:02:10,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2022-12-13 12:02:10,967 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2022-12-13 12:02:10,967 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:10,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 2/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-13 12:02:10,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2022-12-13 12:02:10,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 124 transitions, 260 flow [2022-12-13 12:02:10,984 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:11,001 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 124 transitions, 260 flow [2022-12-13 12:02:11,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 124 transitions, 260 flow [2022-12-13 12:02:11,048 INFO L130 PetriNetUnfolder]: 1/124 cut-off events. [2022-12-13 12:02:11,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:11,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 1/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 46 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-13 12:02:11,050 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 124 transitions, 260 flow [2022-12-13 12:02:11,050 INFO L226 LiptonReduction]: Number of co-enabled transitions 1736 [2022-12-13 12:02:19,314 INFO L241 LiptonReduction]: Total number of compositions: 102 [2022-12-13 12:02:19,347 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:02:19,352 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;@38cbad1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:02:19,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 12:02:19,357 INFO L130 PetriNetUnfolder]: 0/25 cut-off events. [2022-12-13 12:02:19,357 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:19,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:19,358 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:19,360 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:19,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 620620228, now seen corresponding path program 1 times [2022-12-13 12:02:19,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:19,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462861405] [2022-12-13 12:02:19,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:19,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:19,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:19,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462861405] [2022-12-13 12:02:19,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462861405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:19,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:19,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:02:19,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110559239] [2022-12-13 12:02:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:19,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:02:19,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:02:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:02:19,704 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 12:02:19,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:19,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:19,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 12:02:19,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:21,144 INFO L130 PetriNetUnfolder]: 4983/7021 cut-off events. [2022-12-13 12:02:21,144 INFO L131 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-12-13 12:02:21,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14013 conditions, 7021 events. 4983/7021 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 37029 event pairs, 4983 based on Foata normal form. 0/5434 useless extension candidates. Maximal degree in co-relation 14001. Up to 6785 conditions per place. [2022-12-13 12:02:21,251 INFO L137 encePairwiseOnDemand]: 35/36 looper letters, 25 selfloop transitions, 0 changer transitions 0/35 dead transitions. [2022-12-13 12:02:21,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 35 transitions, 132 flow [2022-12-13 12:02:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:02:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:02:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-12-13 12:02:21,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2022-12-13 12:02:21,284 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 2 states and 46 transitions. [2022-12-13 12:02:21,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 35 transitions, 132 flow [2022-12-13 12:02:21,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:02:21,296 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 78 flow [2022-12-13 12:02:21,298 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-13 12:02:21,302 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2022-12-13 12:02:21,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:21,302 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 78 flow [2022-12-13 12:02:21,304 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:21,304 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:21,305 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 78 flow [2022-12-13 12:02:21,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 78 flow [2022-12-13 12:02:21,336 INFO L130 PetriNetUnfolder]: 0/35 cut-off events. [2022-12-13 12:02:21,336 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:21,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 84 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-13 12:02:21,339 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 78 flow [2022-12-13 12:02:21,339 INFO L226 LiptonReduction]: Number of co-enabled transitions 714 [2022-12-13 12:02:21,694 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:21,695 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 393 [2022-12-13 12:02:21,695 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 78 flow [2022-12-13 12:02:21,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:21,696 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:21,696 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:21,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:02:21,696 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -584403207, now seen corresponding path program 1 times [2022-12-13 12:02:21,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:21,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870733583] [2022-12-13 12:02:21,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:21,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870733583] [2022-12-13 12:02:21,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870733583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:21,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:21,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:02:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272603957] [2022-12-13 12:02:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:21,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:02:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:02:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:02:21,807 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:21,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-13 12:02:21,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:21,807 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:21,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:22,904 INFO L130 PetriNetUnfolder]: 6161/8917 cut-off events. [2022-12-13 12:02:22,904 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:22,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17533 conditions, 8917 events. 6161/8917 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 49446 event pairs, 2378 based on Foata normal form. 50/7133 useless extension candidates. Maximal degree in co-relation 17525. Up to 7888 conditions per place. [2022-12-13 12:02:22,947 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2022-12-13 12:02:22,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 212 flow [2022-12-13 12:02:22,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:22,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-13 12:02:22,949 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2022-12-13 12:02:22,949 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 78 flow. Second operand 3 states and 73 transitions. [2022-12-13 12:02:22,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 212 flow [2022-12-13 12:02:22,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 212 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:02:22,951 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:22,951 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2022-12-13 12:02:22,952 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2022-12-13 12:02:22,952 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:22,952 INFO L89 Accepts]: Start accepts. Operand has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:22,953 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:22,953 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:22,953 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:22,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:22,959 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 12:02:22,959 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:02:22,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 47 events. 3/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 62. Up to 10 conditions per place. [2022-12-13 12:02:22,960 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:22,960 INFO L226 LiptonReduction]: Number of co-enabled transitions 784 [2022-12-13 12:02:23,130 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:23,131 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-13 12:02:23,131 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 97 flow [2022-12-13 12:02:23,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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-13 12:02:23,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:23,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:23,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:02:23,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:23,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:23,132 INFO L85 PathProgramCache]: Analyzing trace with hash -936630990, now seen corresponding path program 1 times [2022-12-13 12:02:23,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:23,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609499599] [2022-12-13 12:02:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:23,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:23,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-13 12:02:23,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:23,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609499599] [2022-12-13 12:02:23,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609499599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:23,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:23,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:02:23,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624946560] [2022-12-13 12:02:23,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:23,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:02:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:23,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:02:23,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:02:23,405 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 12:02:23,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 97 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:23,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:23,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 12:02:23,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:24,591 INFO L130 PetriNetUnfolder]: 5413/8166 cut-off events. [2022-12-13 12:02:24,591 INFO L131 PetriNetUnfolder]: For 827/828 co-relation queries the response was YES. [2022-12-13 12:02:24,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16877 conditions, 8166 events. 5413/8166 cut-off events. For 827/828 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 48438 event pairs, 923 based on Foata normal form. 90/6520 useless extension candidates. Maximal degree in co-relation 16866. Up to 6351 conditions per place. [2022-12-13 12:02:24,632 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 39 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2022-12-13 12:02:24,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 216 flow [2022-12-13 12:02:24,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 12:02:24,634 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 12:02:24,634 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 97 flow. Second operand 3 states and 70 transitions. [2022-12-13 12:02:24,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 216 flow [2022-12-13 12:02:24,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:02:24,635 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:24,636 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2022-12-13 12:02:24,636 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2022-12-13 12:02:24,636 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:24,636 INFO L89 Accepts]: Start accepts. Operand has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:24,637 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:24,637 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:24,637 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:24,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:24,643 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 12:02:24,643 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:02:24,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 47 events. 3/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 136 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 65. Up to 10 conditions per place. [2022-12-13 12:02:24,644 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:24,644 INFO L226 LiptonReduction]: Number of co-enabled transitions 780 [2022-12-13 12:02:24,649 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:24,650 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 12:02:24,650 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 102 flow [2022-12-13 12:02:24,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:24,650 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:24,651 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:24,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:02:24,651 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:24,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:24,651 INFO L85 PathProgramCache]: Analyzing trace with hash -394582952, now seen corresponding path program 1 times [2022-12-13 12:02:24,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:24,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124622836] [2022-12-13 12:02:24,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:24,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:24,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:24,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124622836] [2022-12-13 12:02:24,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124622836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:24,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:24,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:02:24,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726703995] [2022-12-13 12:02:24,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:24,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:02:24,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:24,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:02:24,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:02:24,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2022-12-13 12:02:24,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:24,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:24,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2022-12-13 12:02:24,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:25,725 INFO L130 PetriNetUnfolder]: 5326/7798 cut-off events. [2022-12-13 12:02:25,726 INFO L131 PetriNetUnfolder]: For 1748/1748 co-relation queries the response was YES. [2022-12-13 12:02:25,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17110 conditions, 7798 events. 5326/7798 cut-off events. For 1748/1748 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 43545 event pairs, 2322 based on Foata normal form. 60/6166 useless extension candidates. Maximal degree in co-relation 17097. Up to 6096 conditions per place. [2022-12-13 12:02:25,759 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 43 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2022-12-13 12:02:25,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 56 transitions, 241 flow [2022-12-13 12:02:25,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:25,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 12:02:25,761 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 12:02:25,762 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 102 flow. Second operand 3 states and 75 transitions. [2022-12-13 12:02:25,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 56 transitions, 241 flow [2022-12-13 12:02:25,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:25,764 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:25,764 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2022-12-13 12:02:25,764 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2022-12-13 12:02:25,764 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:25,765 INFO L89 Accepts]: Start accepts. Operand has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:25,765 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:25,765 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:25,765 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:25,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:25,772 INFO L130 PetriNetUnfolder]: 3/47 cut-off events. [2022-12-13 12:02:25,773 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 12:02:25,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 47 events. 3/47 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 69. Up to 10 conditions per place. [2022-12-13 12:02:25,773 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:25,774 INFO L226 LiptonReduction]: Number of co-enabled transitions 776 [2022-12-13 12:02:25,877 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:25,878 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 114 [2022-12-13 12:02:25,879 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 106 flow [2022-12-13 12:02:25,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:25,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:25,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:25,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:02:25,879 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:25,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1591632500, now seen corresponding path program 1 times [2022-12-13 12:02:25,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:25,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313515445] [2022-12-13 12:02:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:25,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:25,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:25,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:25,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313515445] [2022-12-13 12:02:25,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313515445] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:25,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:25,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:02:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468070546] [2022-12-13 12:02:25,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:25,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:02:25,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:02:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:02:25,942 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:25,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:25,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:25,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:25,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:27,126 INFO L130 PetriNetUnfolder]: 7788/11424 cut-off events. [2022-12-13 12:02:27,126 INFO L131 PetriNetUnfolder]: For 3249/3249 co-relation queries the response was YES. [2022-12-13 12:02:27,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25292 conditions, 11424 events. 7788/11424 cut-off events. For 3249/3249 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 68568 event pairs, 3939 based on Foata normal form. 240/8963 useless extension candidates. Maximal degree in co-relation 25278. Up to 6306 conditions per place. [2022-12-13 12:02:27,181 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 45 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2022-12-13 12:02:27,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 249 flow [2022-12-13 12:02:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-12-13 12:02:27,183 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2022-12-13 12:02:27,183 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 106 flow. Second operand 3 states and 75 transitions. [2022-12-13 12:02:27,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 249 flow [2022-12-13 12:02:27,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:27,187 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:27,188 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2022-12-13 12:02:27,190 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2022-12-13 12:02:27,190 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:27,190 INFO L89 Accepts]: Start accepts. Operand has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:27,192 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:27,192 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:27,192 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:27,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:27,206 INFO L130 PetriNetUnfolder]: 0/48 cut-off events. [2022-12-13 12:02:27,206 INFO L131 PetriNetUnfolder]: For 19/25 co-relation queries the response was YES. [2022-12-13 12:02:27,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 48 events. 0/48 cut-off events. For 19/25 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-12-13 12:02:27,208 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:27,208 INFO L226 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-13 12:02:27,211 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:27,215 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-13 12:02:27,215 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 113 flow [2022-12-13 12:02:27,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:27,215 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:27,215 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:27,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:02:27,215 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1004679561, now seen corresponding path program 1 times [2022-12-13 12:02:27,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:27,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298174458] [2022-12-13 12:02:27,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:27,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:28,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:28,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298174458] [2022-12-13 12:02:28,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298174458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:28,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:28,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:02:28,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912193564] [2022-12-13 12:02:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:28,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:02:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:28,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:02:28,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:02:28,312 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:28,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:28,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:28,312 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:28,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:29,489 INFO L130 PetriNetUnfolder]: 8146/11990 cut-off events. [2022-12-13 12:02:29,489 INFO L131 PetriNetUnfolder]: For 4172/4273 co-relation queries the response was YES. [2022-12-13 12:02:29,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26836 conditions, 11990 events. 8146/11990 cut-off events. For 4172/4273 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 72255 event pairs, 2038 based on Foata normal form. 37/9220 useless extension candidates. Maximal degree in co-relation 26822. Up to 10353 conditions per place. [2022-12-13 12:02:29,534 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 38 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2022-12-13 12:02:29,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 234 flow [2022-12-13 12:02:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-13 12:02:29,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-13 12:02:29,536 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 113 flow. Second operand 3 states and 67 transitions. [2022-12-13 12:02:29,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 234 flow [2022-12-13 12:02:29,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 226 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 12:02:29,540 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 127 flow [2022-12-13 12:02:29,540 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-12-13 12:02:29,541 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2022-12-13 12:02:29,541 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:29,541 INFO L89 Accepts]: Start accepts. Operand has 53 places, 39 transitions, 127 flow [2022-12-13 12:02:29,541 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:29,541 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:29,542 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 39 transitions, 127 flow [2022-12-13 12:02:29,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 39 transitions, 127 flow [2022-12-13 12:02:29,550 INFO L130 PetriNetUnfolder]: 5/74 cut-off events. [2022-12-13 12:02:29,550 INFO L131 PetriNetUnfolder]: For 50/58 co-relation queries the response was YES. [2022-12-13 12:02:29,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 74 events. 5/74 cut-off events. For 50/58 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 268 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 130. Up to 15 conditions per place. [2022-12-13 12:02:29,551 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 39 transitions, 127 flow [2022-12-13 12:02:29,551 INFO L226 LiptonReduction]: Number of co-enabled transitions 828 [2022-12-13 12:02:29,598 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:29,599 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-13 12:02:29,599 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 127 flow [2022-12-13 12:02:29,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:29,599 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:29,599 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:29,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:02:29,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1080292516, now seen corresponding path program 1 times [2022-12-13 12:02:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:29,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854332097] [2022-12-13 12:02:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:29,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:29,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854332097] [2022-12-13 12:02:29,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854332097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:29,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:29,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:02:29,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401691087] [2022-12-13 12:02:29,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:29,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:02:29,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:29,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:02:29,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:02:29,815 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:29,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:29,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:29,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:29,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:31,108 INFO L130 PetriNetUnfolder]: 9514/13762 cut-off events. [2022-12-13 12:02:31,108 INFO L131 PetriNetUnfolder]: For 5641/5758 co-relation queries the response was YES. [2022-12-13 12:02:31,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31710 conditions, 13762 events. 9514/13762 cut-off events. For 5641/5758 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 81959 event pairs, 7242 based on Foata normal form. 89/10666 useless extension candidates. Maximal degree in co-relation 31694. Up to 11558 conditions per place. [2022-12-13 12:02:31,174 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 36 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2022-12-13 12:02:31,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 258 flow [2022-12-13 12:02:31,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:02:31,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:02:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 12:02:31,176 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2022-12-13 12:02:31,176 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 127 flow. Second operand 4 states and 78 transitions. [2022-12-13 12:02:31,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 258 flow [2022-12-13 12:02:31,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 55 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:02:31,179 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 179 flow [2022-12-13 12:02:31,180 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-13 12:02:31,180 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2022-12-13 12:02:31,180 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:31,180 INFO L89 Accepts]: Start accepts. Operand has 56 places, 45 transitions, 179 flow [2022-12-13 12:02:31,181 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:31,181 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:31,181 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 179 flow [2022-12-13 12:02:31,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 179 flow [2022-12-13 12:02:31,223 INFO L130 PetriNetUnfolder]: 95/332 cut-off events. [2022-12-13 12:02:31,223 INFO L131 PetriNetUnfolder]: For 259/289 co-relation queries the response was YES. [2022-12-13 12:02:31,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 332 events. 95/332 cut-off events. For 259/289 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1995 event pairs, 43 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 731. Up to 148 conditions per place. [2022-12-13 12:02:31,228 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 179 flow [2022-12-13 12:02:31,228 INFO L226 LiptonReduction]: Number of co-enabled transitions 956 [2022-12-13 12:02:31,229 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:31,230 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-13 12:02:31,230 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 179 flow [2022-12-13 12:02:31,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:31,230 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:31,230 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:31,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:02:31,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1080187426, now seen corresponding path program 2 times [2022-12-13 12:02:31,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:31,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894392203] [2022-12-13 12:02:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:32,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894392203] [2022-12-13 12:02:32,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894392203] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:32,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:32,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:02:32,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929815779] [2022-12-13 12:02:32,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:32,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:02:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:32,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:02:32,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:02:32,108 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2022-12-13 12:02:32,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:32,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:32,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2022-12-13 12:02:32,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:34,941 INFO L130 PetriNetUnfolder]: 18778/27376 cut-off events. [2022-12-13 12:02:34,941 INFO L131 PetriNetUnfolder]: For 23697/23953 co-relation queries the response was YES. [2022-12-13 12:02:34,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70479 conditions, 27376 events. 18778/27376 cut-off events. For 23697/23953 co-relation queries the response was YES. Maximal size of possible extension queue 1717. Compared 188739 event pairs, 3529 based on Foata normal form. 304/21009 useless extension candidates. Maximal degree in co-relation 70461. Up to 11869 conditions per place. [2022-12-13 12:02:35,074 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 92 selfloop transitions, 13 changer transitions 7/122 dead transitions. [2022-12-13 12:02:35,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 122 transitions, 666 flow [2022-12-13 12:02:35,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:02:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 12:02:35,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2022-12-13 12:02:35,077 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2022-12-13 12:02:35,077 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 179 flow. Second operand 7 states and 165 transitions. [2022-12-13 12:02:35,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 122 transitions, 666 flow [2022-12-13 12:02:35,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 122 transitions, 645 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:35,093 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 289 flow [2022-12-13 12:02:35,093 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=289, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2022-12-13 12:02:35,093 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2022-12-13 12:02:35,094 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:35,094 INFO L89 Accepts]: Start accepts. Operand has 64 places, 55 transitions, 289 flow [2022-12-13 12:02:35,094 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:35,094 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:35,095 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 55 transitions, 289 flow [2022-12-13 12:02:35,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 55 transitions, 289 flow [2022-12-13 12:02:35,174 INFO L130 PetriNetUnfolder]: 123/463 cut-off events. [2022-12-13 12:02:35,174 INFO L131 PetriNetUnfolder]: For 872/927 co-relation queries the response was YES. [2022-12-13 12:02:35,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 463 events. 123/463 cut-off events. For 872/927 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3242 event pairs, 40 based on Foata normal form. 2/326 useless extension candidates. Maximal degree in co-relation 1169. Up to 196 conditions per place. [2022-12-13 12:02:35,181 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 55 transitions, 289 flow [2022-12-13 12:02:35,181 INFO L226 LiptonReduction]: Number of co-enabled transitions 1166 [2022-12-13 12:02:35,223 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [707] L808-->L810: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [830] L857-3-->L859-2: Formula: (and (= (store |v_#length_93| |v_ULTIMATE.start_main_~#t2148~0#1.base_28| 4) |v_#length_92|) (= |v_ULTIMATE.start_main_~#t2148~0#1.offset_28| 0) (= (store |v_#memory_int_451| |v_ULTIMATE.start_main_~#t2148~0#1.base_28| (store (select |v_#memory_int_451| |v_ULTIMATE.start_main_~#t2148~0#1.base_28|) |v_ULTIMATE.start_main_~#t2148~0#1.offset_28| |v_ULTIMATE.start_main_#t~pre31#1_37|)) |v_#memory_int_450|) (= (select |v_#valid_106| |v_ULTIMATE.start_main_~#t2148~0#1.base_28|) 0) (= (store |v_#valid_106| |v_ULTIMATE.start_main_~#t2148~0#1.base_28| 1) |v_#valid_105|) (= |v_#pthreadsForks_74| |v_ULTIMATE.start_main_#t~pre31#1_37|) (< |v_#StackHeapBarrier_44| |v_ULTIMATE.start_main_~#t2148~0#1.base_28|) (not (= |v_ULTIMATE.start_main_~#t2148~0#1.base_28| 0)) (= |v_#pthreadsForks_73| (+ |v_#pthreadsForks_74| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_44|, #pthreadsForks=|v_#pthreadsForks_74|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_451|, #length=|v_#length_93|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_37|, ULTIMATE.start_main_~#t2148~0#1.base=|v_ULTIMATE.start_main_~#t2148~0#1.base_28|, #StackHeapBarrier=|v_#StackHeapBarrier_44|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_37|, #pthreadsForks=|v_#pthreadsForks_73|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_25|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_450|, ULTIMATE.start_main_~#t2148~0#1.offset=|v_ULTIMATE.start_main_~#t2148~0#1.offset_28|, #length=|v_#length_92|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_main_~#t2148~0#1.base, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, #valid, #memory_int, ULTIMATE.start_main_~#t2148~0#1.offset, #length] [2022-12-13 12:02:35,281 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [707] L808-->L810: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [820] L3-1-->L870: Formula: (let ((.cse4 (= (mod v_~y$r_buff0_thd0~0_126 256) 0))) (let ((.cse10 (not (= (mod v_~y$w_buff0_used~0_298 256) 0))) (.cse1 (not .cse4)) (.cse9 (= (mod v_~y$r_buff1_thd0~0_119 256) 0)) (.cse8 (= (mod v_~y$w_buff1_used~0_290 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_299 256) 0))) (let ((.cse0 (select |v_#memory_int_407| |v_~#y~0.base_230|)) (.cse3 (not .cse5)) (.cse6 (not .cse8)) (.cse7 (not .cse9)) (.cse11 (and .cse10 .cse1))) (and (= (store |v_#memory_int_407| |v_~#y~0.base_230| (store .cse0 |v_~#y~0.offset_230| |v_ULTIMATE.start_main_#t~ite35#1_43|)) |v_#memory_int_406|) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~mem33#1_51| |v_ULTIMATE.start_main_#t~mem33#1_49|))) (or (and (= |v_ULTIMATE.start_main_#t~ite35#1_43| v_~y$w_buff0~0_178) .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite34#1_50| |v_ULTIMATE.start_main_#t~ite34#1_48|) .cse3) (and (or .cse4 .cse5) (= |v_ULTIMATE.start_main_#t~ite34#1_48| |v_ULTIMATE.start_main_#t~ite35#1_43|) (or (and .cse2 .cse6 (= |v_ULTIMATE.start_main_#t~ite34#1_48| v_~y$w_buff1~0_174) .cse7) (and (= |v_ULTIMATE.start_main_#t~mem33#1_49| (select .cse0 |v_~#y~0.offset_230|)) (or .cse8 .cse9) (= |v_ULTIMATE.start_main_#t~ite34#1_48| |v_ULTIMATE.start_main_#t~mem33#1_49|)))))) (= v_~y$r_buff1_thd0~0_118 (ite (or (and .cse10 (not (= (mod v_~y$r_buff0_thd0~0_125 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_289 256) 0)) .cse7)) 0 v_~y$r_buff1_thd0~0_119)) (= v_~y$r_buff0_thd0~0_125 (ite .cse11 0 v_~y$r_buff0_thd0~0_126)) (= (ite (and .cse1 .cse3) 0 v_~y$w_buff0_used~0_299) v_~y$w_buff0_used~0_298) (= (ite (or (and .cse6 .cse7) .cse11) 0 v_~y$w_buff1_used~0_290) v_~y$w_buff1_used~0_289))))) InVars {~#y~0.offset=|v_~#y~0.offset_230|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_51|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_299, ~y$w_buff1~0=v_~y$w_buff1~0_174, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_50|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_126, ~y$w_buff0~0=v_~y$w_buff0~0_178, #memory_int=|v_#memory_int_407|, ~#y~0.base=|v_~#y~0.base_230|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_119, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_290} OutVars{ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_42|, ~#y~0.offset=|v_~#y~0.offset_230|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_298, ~y$w_buff1~0=v_~y$w_buff1~0_174, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_178, #memory_int=|v_#memory_int_406|, ~#y~0.base=|v_~#y~0.base_230|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_118, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_289} AuxVars[|v_ULTIMATE.start_main_#t~ite35#1_43|, |v_ULTIMATE.start_main_#t~mem33#1_49|, |v_ULTIMATE.start_main_#t~ite34#1_48|] AssignedVars[ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~mem33#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite34#1, ~y$r_buff0_thd0~0, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:02:35,580 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [707] L808-->L810: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] and [763] $Ultimate##0-->L827: Formula: (and (= (store |v_#memory_int_343| |v_~#y~0.base_208| (store (select |v_#memory_int_343| |v_~#y~0.base_208|) |v_~#y~0.offset_208| 2)) |v_#memory_int_342|) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_208|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_208|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] [2022-12-13 12:02:35,917 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:02:35,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 823 [2022-12-13 12:02:35,918 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 298 flow [2022-12-13 12:02:35,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:35,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:35,918 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:35,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:02:35,918 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash -559126214, now seen corresponding path program 3 times [2022-12-13 12:02:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:35,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985904997] [2022-12-13 12:02:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:35,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:36,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:36,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985904997] [2022-12-13 12:02:36,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985904997] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:36,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:36,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:02:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305580937] [2022-12-13 12:02:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:36,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:02:36,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:02:36,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:02:36,663 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 12:02:36,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 298 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:36,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:36,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 12:02:36,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:39,501 INFO L130 PetriNetUnfolder]: 16108/23560 cut-off events. [2022-12-13 12:02:39,503 INFO L131 PetriNetUnfolder]: For 30521/30713 co-relation queries the response was YES. [2022-12-13 12:02:39,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65276 conditions, 23560 events. 16108/23560 cut-off events. For 30521/30713 co-relation queries the response was YES. Maximal size of possible extension queue 1416. Compared 159099 event pairs, 10171 based on Foata normal form. 108/18107 useless extension candidates. Maximal degree in co-relation 65254. Up to 20029 conditions per place. [2022-12-13 12:02:39,788 INFO L137 encePairwiseOnDemand]: 29/39 looper letters, 55 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2022-12-13 12:02:39,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 524 flow [2022-12-13 12:02:39,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:02:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:02:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-13 12:02:39,809 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5435897435897435 [2022-12-13 12:02:39,809 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 298 flow. Second operand 5 states and 106 transitions. [2022-12-13 12:02:39,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 524 flow [2022-12-13 12:02:39,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 80 transitions, 490 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-13 12:02:39,908 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 340 flow [2022-12-13 12:02:39,908 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2022-12-13 12:02:39,909 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2022-12-13 12:02:39,909 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:39,909 INFO L89 Accepts]: Start accepts. Operand has 65 places, 59 transitions, 340 flow [2022-12-13 12:02:39,910 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:39,910 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:39,910 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 59 transitions, 340 flow [2022-12-13 12:02:39,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 59 transitions, 340 flow [2022-12-13 12:02:39,991 INFO L130 PetriNetUnfolder]: 130/509 cut-off events. [2022-12-13 12:02:39,991 INFO L131 PetriNetUnfolder]: For 868/938 co-relation queries the response was YES. [2022-12-13 12:02:39,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 509 events. 130/509 cut-off events. For 868/938 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3777 event pairs, 34 based on Foata normal form. 2/352 useless extension candidates. Maximal degree in co-relation 1362. Up to 209 conditions per place. [2022-12-13 12:02:39,998 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 59 transitions, 340 flow [2022-12-13 12:02:39,999 INFO L226 LiptonReduction]: Number of co-enabled transitions 1272 [2022-12-13 12:02:40,000 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:40,001 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-13 12:02:40,001 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 340 flow [2022-12-13 12:02:40,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:40,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:40,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:40,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:02:40,002 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:40,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1691695065, now seen corresponding path program 1 times [2022-12-13 12:02:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:40,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785436069] [2022-12-13 12:02:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:40,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:40,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785436069] [2022-12-13 12:02:40,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785436069] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:40,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:40,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:02:40,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936988675] [2022-12-13 12:02:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:40,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:02:40,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:40,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:02:40,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:02:40,536 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 12:02:40,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 340 flow. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:40,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:40,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 12:02:40,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:43,061 INFO L130 PetriNetUnfolder]: 16319/23706 cut-off events. [2022-12-13 12:02:43,061 INFO L131 PetriNetUnfolder]: For 33620/33828 co-relation queries the response was YES. [2022-12-13 12:02:43,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70676 conditions, 23706 events. 16319/23706 cut-off events. For 33620/33828 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 157664 event pairs, 12291 based on Foata normal form. 112/18175 useless extension candidates. Maximal degree in co-relation 70654. Up to 20606 conditions per place. [2022-12-13 12:02:43,183 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 51 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2022-12-13 12:02:43,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 539 flow [2022-12-13 12:02:43,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:02:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:02:43,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2022-12-13 12:02:43,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2022-12-13 12:02:43,185 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 340 flow. Second operand 4 states and 82 transitions. [2022-12-13 12:02:43,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 539 flow [2022-12-13 12:02:43,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 513 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 12:02:43,223 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 406 flow [2022-12-13 12:02:43,223 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=406, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2022-12-13 12:02:43,224 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 18 predicate places. [2022-12-13 12:02:43,224 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:43,224 INFO L89 Accepts]: Start accepts. Operand has 66 places, 64 transitions, 406 flow [2022-12-13 12:02:43,226 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:43,227 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:43,227 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 64 transitions, 406 flow [2022-12-13 12:02:43,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 64 transitions, 406 flow [2022-12-13 12:02:43,291 INFO L130 PetriNetUnfolder]: 132/512 cut-off events. [2022-12-13 12:02:43,292 INFO L131 PetriNetUnfolder]: For 1125/1193 co-relation queries the response was YES. [2022-12-13 12:02:43,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 512 events. 132/512 cut-off events. For 1125/1193 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3750 event pairs, 34 based on Foata normal form. 2/356 useless extension candidates. Maximal degree in co-relation 1523. Up to 215 conditions per place. [2022-12-13 12:02:43,298 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 64 transitions, 406 flow [2022-12-13 12:02:43,298 INFO L226 LiptonReduction]: Number of co-enabled transitions 1402 [2022-12-13 12:02:43,300 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:43,301 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-13 12:02:43,302 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 406 flow [2022-12-13 12:02:43,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:43,302 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:43,302 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:43,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:02:43,302 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:43,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:43,302 INFO L85 PathProgramCache]: Analyzing trace with hash -608121528, now seen corresponding path program 1 times [2022-12-13 12:02:43,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:43,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325815253] [2022-12-13 12:02:43,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:43,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325815253] [2022-12-13 12:02:43,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325815253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:43,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:43,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:02:43,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914760628] [2022-12-13 12:02:43,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:43,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:02:43,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:02:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:02:43,458 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2022-12-13 12:02:43,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:43,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:43,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2022-12-13 12:02:43,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:48,276 INFO L130 PetriNetUnfolder]: 35887/49052 cut-off events. [2022-12-13 12:02:48,276 INFO L131 PetriNetUnfolder]: For 106576/108231 co-relation queries the response was YES. [2022-12-13 12:02:48,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151790 conditions, 49052 events. 35887/49052 cut-off events. For 106576/108231 co-relation queries the response was YES. Maximal size of possible extension queue 2844. Compared 318564 event pairs, 12885 based on Foata normal form. 1384/31819 useless extension candidates. Maximal degree in co-relation 151766. Up to 48250 conditions per place. [2022-12-13 12:02:48,714 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 88 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2022-12-13 12:02:48,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 867 flow [2022-12-13 12:02:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:02:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:02:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2022-12-13 12:02:48,715 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2022-12-13 12:02:48,715 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 406 flow. Second operand 3 states and 79 transitions. [2022-12-13 12:02:48,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 867 flow [2022-12-13 12:02:48,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 109 transitions, 836 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 12:02:48,759 INFO L231 Difference]: Finished difference. Result has 67 places, 76 transitions, 476 flow [2022-12-13 12:02:48,759 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=67, PETRI_TRANSITIONS=76} [2022-12-13 12:02:48,760 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2022-12-13 12:02:48,760 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:48,760 INFO L89 Accepts]: Start accepts. Operand has 67 places, 76 transitions, 476 flow [2022-12-13 12:02:48,761 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:48,761 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:48,761 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 76 transitions, 476 flow [2022-12-13 12:02:48,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 76 transitions, 476 flow [2022-12-13 12:02:50,496 INFO L130 PetriNetUnfolder]: 14229/21343 cut-off events. [2022-12-13 12:02:50,496 INFO L131 PetriNetUnfolder]: For 14371/16181 co-relation queries the response was YES. [2022-12-13 12:02:50,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51993 conditions, 21343 events. 14229/21343 cut-off events. For 14371/16181 co-relation queries the response was YES. Maximal size of possible extension queue 2814. Compared 174030 event pairs, 8167 based on Foata normal form. 72/9490 useless extension candidates. Maximal degree in co-relation 51971. Up to 17185 conditions per place. [2022-12-13 12:02:50,750 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 76 transitions, 476 flow [2022-12-13 12:02:50,751 INFO L226 LiptonReduction]: Number of co-enabled transitions 1768 [2022-12-13 12:02:50,815 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:02:50,816 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2056 [2022-12-13 12:02:50,816 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 476 flow [2022-12-13 12:02:50,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:50,816 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:50,816 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:50,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:02:50,816 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1707531364, now seen corresponding path program 1 times [2022-12-13 12:02:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:50,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645143204] [2022-12-13 12:02:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:02:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:02:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:02:50,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645143204] [2022-12-13 12:02:50,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645143204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:02:50,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:02:50,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:02:50,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622160823] [2022-12-13 12:02:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:02:50,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:02:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:02:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:02:50,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:02:50,978 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2022-12-13 12:02:50,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 476 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:50,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:02:50,978 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2022-12-13 12:02:50,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:02:54,995 INFO L130 PetriNetUnfolder]: 26995/38513 cut-off events. [2022-12-13 12:02:54,996 INFO L131 PetriNetUnfolder]: For 85583/86836 co-relation queries the response was YES. [2022-12-13 12:02:55,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144422 conditions, 38513 events. 26995/38513 cut-off events. For 85583/86836 co-relation queries the response was YES. Maximal size of possible extension queue 2515. Compared 265041 event pairs, 4584 based on Foata normal form. 1544/25778 useless extension candidates. Maximal degree in co-relation 144397. Up to 35245 conditions per place. [2022-12-13 12:02:55,271 INFO L137 encePairwiseOnDemand]: 25/39 looper letters, 115 selfloop transitions, 25 changer transitions 0/148 dead transitions. [2022-12-13 12:02:55,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 148 transitions, 1219 flow [2022-12-13 12:02:55,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:02:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:02:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2022-12-13 12:02:55,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7051282051282052 [2022-12-13 12:02:55,273 INFO L175 Difference]: Start difference. First operand has 67 places, 76 transitions, 476 flow. Second operand 4 states and 110 transitions. [2022-12-13 12:02:55,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 148 transitions, 1219 flow [2022-12-13 12:02:55,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 148 transitions, 1206 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:02:55,305 INFO L231 Difference]: Finished difference. Result has 70 places, 88 transitions, 611 flow [2022-12-13 12:02:55,306 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=611, PETRI_PLACES=70, PETRI_TRANSITIONS=88} [2022-12-13 12:02:55,306 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2022-12-13 12:02:55,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:02:55,306 INFO L89 Accepts]: Start accepts. Operand has 70 places, 88 transitions, 611 flow [2022-12-13 12:02:55,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:02:55,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:02:55,307 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 88 transitions, 611 flow [2022-12-13 12:02:55,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 88 transitions, 611 flow [2022-12-13 12:02:56,854 INFO L130 PetriNetUnfolder]: 10635/17325 cut-off events. [2022-12-13 12:02:56,854 INFO L131 PetriNetUnfolder]: For 22109/36234 co-relation queries the response was YES. [2022-12-13 12:02:56,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60114 conditions, 17325 events. 10635/17325 cut-off events. For 22109/36234 co-relation queries the response was YES. Maximal size of possible extension queue 2619. Compared 150826 event pairs, 3631 based on Foata normal form. 72/9050 useless extension candidates. Maximal degree in co-relation 60090. Up to 12454 conditions per place. [2022-12-13 12:02:56,983 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 88 transitions, 611 flow [2022-12-13 12:02:56,984 INFO L226 LiptonReduction]: Number of co-enabled transitions 2014 [2022-12-13 12:02:57,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L827: Formula: (and (= (store |v_#memory_int_343| |v_~#y~0.base_208| (store (select |v_#memory_int_343| |v_~#y~0.base_208|) |v_~#y~0.offset_208| 2)) |v_#memory_int_342|) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_208|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_208|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] and [824] L870-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_131 256) 0)) (.cse18 (= (mod v_~y$w_buff1_used~0_302 256) 0)) (.cse15 (= (mod v_~y$r_buff0_thd0~0_136 256) 0)) (.cse19 (= (mod v_~y$w_buff0_used~0_311 256) 0))) (let ((.cse17 (not .cse19)) (.cse16 (not .cse15)) (.cse3 (select |v_#memory_int_423| |v_~#y~0.base_236|)) (.cse9 (and .cse18 .cse15)) (.cse10 (and .cse15 .cse6)) (.cse11 (= (mod v_~weak$$choice2~0_120 256) 0))) (let ((.cse4 (not .cse11)) (.cse8 (= (mod v_~y$w_buff1_used~0_301 256) 0)) (.cse5 (= (mod v_~y$w_buff0_used~0_310 256) 0)) (.cse12 (or .cse9 .cse19 .cse10)) (.cse14 (select .cse3 |v_~#y~0.offset_236|)) (.cse13 (and .cse17 .cse16))) (and (= v_~x~0_51 2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_17| 0) (= (mod v_~main$tmp_guard1~0_44 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|) (= v_~y$flush_delayed~0_108 0) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem42#1_101| |v_ULTIMATE.start_main_#t~mem42#1_99|)) (.cse1 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_57 256) 0))) (or (and (= v_~__unbuffered_p0_EAX~0_98 v_~__unbuffered_p0_EAX~0_97) .cse0 .cse1 (= |v_ULTIMATE.start_main_#t~ite43#1_98| |v_ULTIMATE.start_main_#t~ite43#1_100|)) (and (let ((.cse2 (= (mod v_~weak$$choice1~0_106 256) 0))) (or (and .cse0 .cse2 (= |v_ULTIMATE.start_main_#t~ite43#1_98| v_~__unbuffered_p0_EAX~0_98)) (and (= |v_ULTIMATE.start_main_#t~ite43#1_98| |v_ULTIMATE.start_main_#t~mem42#1_99|) (= (select (select (store |v_#memory_int_423| |v_~#y~0.base_236| (store .cse3 |v_~#y~0.offset_236| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_60) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_60) |v_ULTIMATE.start_main_#t~mem42#1_99|) (not .cse2)))) (not .cse1) (= |v_ULTIMATE.start_main_#t~ite43#1_98| v_~__unbuffered_p0_EAX~0_97)))) (= |v_ULTIMATE.start_main_#t~nondet36#1_81| v_~weak$$choice0~0_120) (= v_~y$r_buff1_thd0~0_130 (ite .cse4 v_~y$r_buff1_thd0~0_131 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd0~0_135 256) 0))) (or .cse5 (and .cse6 .cse7) (and .cse7 .cse8))) v_~y$r_buff1_thd0~0_131 0))) (= v_~weak$$choice1~0_106 |v_ULTIMATE.start_main_#t~nondet41#1_77|) (= (ite .cse4 v_~y$w_buff1_used~0_302 (ite (or .cse5 .cse9 .cse10) v_~y$w_buff1_used~0_302 0)) v_~y$w_buff1_used~0_301) (or (and (= |v_ULTIMATE.start_main_#t~ite48#1_83| |v_ULTIMATE.start_main_#t~mem47#1_97|) (= 2 |v_ULTIMATE.start_main_#t~mem47#1_97|) .cse11) (and .cse4 (= |v_ULTIMATE.start_main_#t~mem47#1_97| |v_ULTIMATE.start_main_#t~mem47#1_99|) (= |v_ULTIMATE.start_main_#t~ite48#1_83| v_~y$mem_tmp~0_74))) (= v_~y$w_buff0_used~0_310 (ite .cse4 v_~y$w_buff0_used~0_311 (ite .cse12 v_~y$w_buff0_used~0_311 (ite .cse13 0 v_~y$w_buff0_used~0_311)))) (= .cse14 v_~y$mem_tmp~0_74) (= v_~y$r_buff0_thd0~0_135 (ite .cse4 v_~y$r_buff0_thd0~0_136 (ite (or (and .cse15 .cse8) .cse5 .cse10) v_~y$r_buff0_thd0~0_136 (ite (and (not .cse5) .cse16) 0 v_~y$r_buff0_thd0~0_136)))) (= v_~weak$$choice2~0_120 |v_ULTIMATE.start_main_#t~nondet37#1_85|) (= (store |v_#memory_int_423| |v_~#y~0.base_236| (store .cse3 |v_~#y~0.offset_236| |v_ULTIMATE.start_main_#t~ite48#1_83|)) |v_#memory_int_422|) (= v_~y$w_buff1~0_183 v_~y$w_buff1~0_182) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~mem39#1_107| 2) (= |v_ULTIMATE.start_main_#t~mem39#1_107| .cse14)) (and .cse17 (= (ite .cse13 v_~y$w_buff0~0_187 v_~y$w_buff1~0_183) 2) (= |v_ULTIMATE.start_main_#t~mem39#1_109| |v_ULTIMATE.start_main_#t~mem39#1_107|) (or .cse16 (not .cse18)) (or .cse16 (not .cse6)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_17|) (= v_~y$w_buff0~0_187 v_~y$w_buff0~0_186) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_43) (= 2 v_~__unbuffered_p0_EAX~0_97) |v_ULTIMATE.start_main_#t~short46#1_115|)) 1 0) 0) 0 1) v_~main$tmp_guard1~0_44) |v_ULTIMATE.start_main_#t~short46#1_116|)))) InVars {~#y~0.offset=|v_~#y~0.offset_236|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_311, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_81|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_99|, ~#y~0.base=|v_~#y~0.base_236|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_60, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_77|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_183, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_100|, ~y$w_buff0~0=v_~y$w_buff0~0_187, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_101|, #memory_int=|v_#memory_int_423|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_60, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_85|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_57, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_109|, ~x~0=v_~x~0_51, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_131, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_302} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_17|, ~#y~0.offset=|v_~#y~0.offset_236|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_310, ULTIMATE.start_main_#t~short46#1=|v_ULTIMATE.start_main_#t~short46#1_114|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_44, ~#y~0.base=|v_~#y~0.base_236|, ~y$mem_tmp~0=v_~y$mem_tmp~0_74, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_97, ~weak$$choice1~0=v_~weak$$choice1~0_106, ULTIMATE.start_main_#t~ite48#1=|v_ULTIMATE.start_main_#t~ite48#1_82|, ~y$w_buff0~0=v_~y$w_buff0~0_186, ~y$flush_delayed~0=v_~y$flush_delayed~0_108, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_66|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_57, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_90|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_102|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_60, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_57|, ~weak$$choice0~0=v_~weak$$choice0~0_120, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_15|, ~y$w_buff1~0=v_~y$w_buff1~0_182, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_135, #memory_int=|v_#memory_int_422|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_60, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_51, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_130, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_301} AuxVars[|v_ULTIMATE.start_main_#t~short46#1_115|, |v_ULTIMATE.start_main_#t~short46#1_116|, |v_ULTIMATE.start_main_#t~mem42#1_99|, |v_ULTIMATE.start_main_#t~mem39#1_107|, |v_ULTIMATE.start_main_#t~mem47#1_97|, |v_ULTIMATE.start_main_#t~ite43#1_98|, |v_ULTIMATE.start_main_#t~ite48#1_83|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~short46#1, ULTIMATE.start_main_#t~mem47#1, ~main$tmp_guard1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite48#1, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:02:58,931 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [816] L859-3-->L3-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| 0)) (= v_~main$tmp_guard0~0_56 (ite (= (ite (= v_~__unbuffered_cnt~0_339 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_339} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_339, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [833] L808-->L870: Formula: (let ((.cse3 (= (mod v_~y$r_buff0_thd0~0_254 256) 0))) (let ((.cse4 (= (mod v_~y$w_buff0_used~0_536 256) 0)) (.cse6 (= (mod v_~y$w_buff1_used~0_527 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd0~0_247 256) 0)) (.cse0 (not (= (mod v_~y$w_buff0_used~0_535 256) 0))) (.cse9 (not .cse3))) (let ((.cse2 (and .cse0 .cse9)) (.cse1 (not .cse5)) (.cse8 (not .cse6)) (.cse10 (not .cse4))) (and (= v_~y$r_buff1_thd0~0_246 (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd0~0_253 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_526 256) 0)))) 0 v_~y$r_buff1_thd0~0_247)) (= v_~y$r_buff0_thd0~0_253 (ite .cse2 0 v_~y$r_buff0_thd0~0_254)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~mem33#1_153| |v_ULTIMATE.start_main_#t~mem33#1_151|))) (or (and (or .cse3 .cse4) (= |v_ULTIMATE.start_main_#t~ite34#1_150| |v_ULTIMATE.start_main_#t~ite35#1_119|) (or (and (= |v_ULTIMATE.start_main_#t~mem33#1_151| 1) (or .cse5 .cse6) (= |v_ULTIMATE.start_main_#t~ite34#1_150| |v_ULTIMATE.start_main_#t~mem33#1_151|)) (and .cse1 .cse7 (= v_~y$w_buff1~0_326 |v_ULTIMATE.start_main_#t~ite34#1_150|) .cse8))) (and .cse7 .cse9 (= |v_ULTIMATE.start_main_#t~ite34#1_150| |v_ULTIMATE.start_main_#t~ite34#1_152|) (= |v_ULTIMATE.start_main_#t~ite35#1_119| v_~y$w_buff0~0_330) .cse10))) (= v_~y$w_buff1_used~0_526 (ite (or .cse2 (and .cse1 .cse8)) 0 v_~y$w_buff1_used~0_527)) (= v_~y$w_buff0_used~0_535 (ite (and .cse9 .cse10) 0 v_~y$w_buff0_used~0_536)) (= (store |v_#memory_int_713| |v_~#y~0.base_336| (store (select |v_#memory_int_713| |v_~#y~0.base_336|) |v_~#y~0.offset_336| |v_ULTIMATE.start_main_#t~ite35#1_119|)) |v_#memory_int_711|))))) InVars {~#y~0.offset=|v_~#y~0.offset_336|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_153|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_536, ~y$w_buff1~0=v_~y$w_buff1~0_326, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_152|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_254, ~y$w_buff0~0=v_~y$w_buff0~0_330, #memory_int=|v_#memory_int_713|, ~#y~0.base=|v_~#y~0.base_336|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_247, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_527} OutVars{ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_118|, ~#y~0.offset=|v_~#y~0.offset_336|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_535, ~y$w_buff1~0=v_~y$w_buff1~0_326, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_253, ~y$w_buff0~0=v_~y$w_buff0~0_330, #memory_int=|v_#memory_int_711|, ~#y~0.base=|v_~#y~0.base_336|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_246, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_526} AuxVars[|v_ULTIMATE.start_main_#t~ite34#1_150|, |v_ULTIMATE.start_main_#t~mem33#1_151|, |v_ULTIMATE.start_main_#t~ite35#1_119|] AssignedVars[ULTIMATE.start_main_#t~ite35#1, ULTIMATE.start_main_#t~mem33#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite34#1, ~y$r_buff0_thd0~0, #memory_int, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:02:59,305 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:02:59,306 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4000 [2022-12-13 12:02:59,306 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 88 transitions, 625 flow [2022-12-13 12:02:59,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:02:59,306 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:02:59,306 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:02:59,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:02:59,307 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:02:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:02:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1482596565, now seen corresponding path program 1 times [2022-12-13 12:02:59,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:02:59,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48441994] [2022-12-13 12:02:59,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:02:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:02:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:00,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:00,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48441994] [2022-12-13 12:03:00,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48441994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:00,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:00,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:03:00,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334481916] [2022-12-13 12:03:00,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:00,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:03:00,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:00,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:03:00,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:03:00,031 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2022-12-13 12:03:00,031 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 88 transitions, 625 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:00,031 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:00,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2022-12-13 12:03:00,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:05,407 INFO L130 PetriNetUnfolder]: 35302/52306 cut-off events. [2022-12-13 12:03:05,408 INFO L131 PetriNetUnfolder]: For 123644/131757 co-relation queries the response was YES. [2022-12-13 12:03:05,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217989 conditions, 52306 events. 35302/52306 cut-off events. For 123644/131757 co-relation queries the response was YES. Maximal size of possible extension queue 3796. Compared 409646 event pairs, 6879 based on Foata normal form. 1471/41173 useless extension candidates. Maximal degree in co-relation 217962. Up to 36513 conditions per place. [2022-12-13 12:03:05,736 INFO L137 encePairwiseOnDemand]: 29/40 looper letters, 113 selfloop transitions, 23 changer transitions 3/157 dead transitions. [2022-12-13 12:03:05,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 157 transitions, 1367 flow [2022-12-13 12:03:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:03:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:03:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-13 12:03:05,738 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.555 [2022-12-13 12:03:05,739 INFO L175 Difference]: Start difference. First operand has 70 places, 88 transitions, 625 flow. Second operand 5 states and 111 transitions. [2022-12-13 12:03:05,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 157 transitions, 1367 flow [2022-12-13 12:03:05,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 157 transitions, 1247 flow, removed 31 selfloop flow, removed 2 redundant places. [2022-12-13 12:03:05,817 INFO L231 Difference]: Finished difference. Result has 74 places, 92 transitions, 702 flow [2022-12-13 12:03:05,817 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=702, PETRI_PLACES=74, PETRI_TRANSITIONS=92} [2022-12-13 12:03:05,818 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 26 predicate places. [2022-12-13 12:03:05,818 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:05,818 INFO L89 Accepts]: Start accepts. Operand has 74 places, 92 transitions, 702 flow [2022-12-13 12:03:05,818 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:05,818 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:05,819 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 92 transitions, 702 flow [2022-12-13 12:03:05,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 92 transitions, 702 flow [2022-12-13 12:03:07,960 INFO L130 PetriNetUnfolder]: 15918/25848 cut-off events. [2022-12-13 12:03:07,960 INFO L131 PetriNetUnfolder]: For 26735/35127 co-relation queries the response was YES. [2022-12-13 12:03:08,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84718 conditions, 25848 events. 15918/25848 cut-off events. For 26735/35127 co-relation queries the response was YES. Maximal size of possible extension queue 4023. Compared 234995 event pairs, 4793 based on Foata normal form. 79/11734 useless extension candidates. Maximal degree in co-relation 84692. Up to 22060 conditions per place. [2022-12-13 12:03:08,329 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 92 transitions, 702 flow [2022-12-13 12:03:08,329 INFO L226 LiptonReduction]: Number of co-enabled transitions 2226 [2022-12-13 12:03:08,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [836] $Ultimate##0-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse8 (= (mod v_~y$w_buff1_used~0_535 256) 0)) (.cse1 (= (mod v_~y$r_buff1_thd0~0_251 256) 0)) (.cse18 (= (mod v_~y$w_buff0_used~0_544 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd0~0_258 256) 0))) (let ((.cse5 (= (mod v_~weak$$choice2~0_176 256) 0)) (.cse7 (not .cse12)) (.cse9 (not .cse18)) (.cse13 (and .cse1 .cse12)) (.cse14 (and .cse12 .cse8))) (let ((.cse6 (or .cse13 .cse18 .cse14)) (.cse10 (and .cse7 .cse9)) (.cse3 (= (mod v_~y$w_buff1_used~0_534 256) 0)) (.cse0 (not .cse5)) (.cse4 (= (mod v_~y$w_buff0_used~0_543 256) 0)) (.cse11 (select |v_#memory_int_731| |v_~#y~0.base_342|))) (and (= |v_P3Thread1of1ForFork2_#in~arg.base_25| v_P3Thread1of1ForFork2_~arg.base_25) (= |v_ULTIMATE.start_main_#t~nondet36#1_139| v_~weak$$choice0~0_176) (= v_~y$r_buff1_thd0~0_250 (ite .cse0 v_~y$r_buff1_thd0~0_251 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd0~0_257 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse2) .cse4)) v_~y$r_buff1_thd0~0_251 0))) (= v_~weak$$choice2~0_176 |v_ULTIMATE.start_main_#t~nondet37#1_143|) (= v_P3Thread1of1ForFork2_~arg.offset_25 |v_P3Thread1of1ForFork2_#in~arg.offset_25|) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~mem47#1_197| |v_ULTIMATE.start_main_#t~mem47#1_195|) (= v_~y$mem_tmp~0_132 |v_ULTIMATE.start_main_#t~ite48#1_153|)) (and (= |v_ULTIMATE.start_main_#t~mem47#1_195| |v_ULTIMATE.start_main_#t~ite48#1_153|) .cse5 (= |v_ULTIMATE.start_main_#t~mem47#1_195| 2))) (= 2 v_~x~0_106) (or (and (= |v_ULTIMATE.start_main_#t~mem39#1_205| 2) .cse6) (and (or .cse7 (not .cse8)) (= |v_ULTIMATE.start_main_#t~mem39#1_207| |v_ULTIMATE.start_main_#t~mem39#1_205|) (or (not .cse1) .cse7) .cse9 (= (ite .cse10 v_~y$w_buff0~0_335 v_~y$w_buff1~0_331) 2))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|) (= (store |v_#memory_int_731| |v_~#y~0.base_342| (store .cse11 |v_~#y~0.offset_342| |v_ULTIMATE.start_main_#t~ite48#1_153|)) |v_#memory_int_729|) (= v_~y$w_buff0_used~0_543 (ite .cse0 v_~y$w_buff0_used~0_544 (ite .cse6 v_~y$w_buff0_used~0_544 (ite .cse10 0 v_~y$w_buff0_used~0_544)))) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_47| 0) (= v_~y$flush_delayed~0_166 0) (= (mod v_~main$tmp_guard1~0_76 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|) (= v_~y$r_buff0_thd0~0_257 (ite .cse0 v_~y$r_buff0_thd0~0_258 (ite (or (and .cse12 .cse3) .cse13 .cse4) v_~y$r_buff0_thd0~0_258 (ite (and .cse7 (not .cse4)) 0 v_~y$r_buff0_thd0~0_258)))) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_182) (= 2 v_~__unbuffered_p2_EAX~0_80) |v_ULTIMATE.start_main_#t~short46#1_225|)) 1 0) 0) 0 1) v_~main$tmp_guard1~0_76) (= v_~y$w_buff1_used~0_534 (ite .cse0 v_~y$w_buff1_used~0_535 (ite (or .cse13 .cse14 .cse4) v_~y$w_buff1_used~0_535 0))) (= v_~y$mem_tmp~0_132 2) (= v_~weak$$choice1~0_162 |v_ULTIMATE.start_main_#t~nondet41#1_135|) (= v_~y$w_buff0~0_335 v_~y$w_buff0~0_334) (= v_~y$w_buff1~0_331 v_~y$w_buff1~0_330) (let ((.cse15 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_114 256) 0)) (.cse16 (= |v_ULTIMATE.start_main_#t~mem42#1_199| |v_ULTIMATE.start_main_#t~mem42#1_197|))) (or (and (not .cse15) (= |v_ULTIMATE.start_main_#t~ite43#1_196| v_~__unbuffered_p0_EAX~0_182) (let ((.cse17 (= (mod v_~weak$$choice1~0_162 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_196| v_~__unbuffered_p0_EAX~0_183) .cse16 .cse17) (and (= |v_ULTIMATE.start_main_#t~mem42#1_197| (select (select (store |v_#memory_int_731| |v_~#y~0.base_342| (store .cse11 |v_~#y~0.offset_342| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_117) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_117)) (not .cse17) (= |v_ULTIMATE.start_main_#t~mem42#1_197| |v_ULTIMATE.start_main_#t~ite43#1_196|))))) (and .cse15 .cse16 (= |v_ULTIMATE.start_main_#t~ite43#1_198| |v_ULTIMATE.start_main_#t~ite43#1_196|) (= v_~__unbuffered_p0_EAX~0_183 v_~__unbuffered_p0_EAX~0_182)))) |v_ULTIMATE.start_main_#t~short46#1_226|)))) InVars {~#y~0.offset=|v_~#y~0.offset_342|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_544, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_139|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_197|, ~#y~0.base=|v_~#y~0.base_342|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_117, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_25|, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_135|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_183, ~y$w_buff1~0=v_~y$w_buff1~0_331, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_198|, ~y$w_buff0~0=v_~y$w_buff0~0_335, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_258, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_199|, #memory_int=|v_#memory_int_731|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_117, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_143|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_114, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_207|, ~x~0=v_~x~0_106, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_251, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_535} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_47|, ~#y~0.offset=|v_~#y~0.offset_342|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_543, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_25, ULTIMATE.start_main_#t~short46#1=|v_ULTIMATE.start_main_#t~short46#1_224|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_76, ~#y~0.base=|v_~#y~0.base_342|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_25, ~y$mem_tmp~0=v_~y$mem_tmp~0_132, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_182, ~weak$$choice1~0=v_~weak$$choice1~0_162, ULTIMATE.start_main_#t~ite48#1=|v_ULTIMATE.start_main_#t~ite48#1_152|, ~y$w_buff0~0=v_~y$w_buff0~0_334, ~y$flush_delayed~0=v_~y$flush_delayed~0_166, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_96|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_80, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_114, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_122|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_135|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_117, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_25|, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_87|, ~weak$$choice0~0=v_~weak$$choice0~0_176, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_43|, ~y$w_buff1~0=v_~y$w_buff1~0_330, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_257, #memory_int=|v_#memory_int_729|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_117, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x~0=v_~x~0_106, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_250, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_534} AuxVars[|v_ULTIMATE.start_main_#t~short46#1_225|, |v_ULTIMATE.start_main_#t~short46#1_226|, |v_ULTIMATE.start_main_#t~mem42#1_197|, |v_ULTIMATE.start_main_#t~ite43#1_196|, |v_ULTIMATE.start_main_#t~mem39#1_205|, |v_ULTIMATE.start_main_#t~mem47#1_195|, |v_ULTIMATE.start_main_#t~ite48#1_153|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, P3Thread1of1ForFork2_~arg.offset, ULTIMATE.start_main_#t~short46#1, ULTIMATE.start_main_#t~mem47#1, ~main$tmp_guard1~0, P3Thread1of1ForFork2_~arg.base, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite48#1, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [707] L808-->L810: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 12:03:09,272 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L827: Formula: (and (= (store |v_#memory_int_343| |v_~#y~0.base_208| (store (select |v_#memory_int_343| |v_~#y~0.base_208|) |v_~#y~0.offset_208| 2)) |v_#memory_int_342|) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_208|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_208|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] and [707] L808-->L810: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 12:03:09,289 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L827: Formula: (and (= (store |v_#memory_int_343| |v_~#y~0.base_208| (store (select |v_#memory_int_343| |v_~#y~0.base_208|) |v_~#y~0.offset_208| 2)) |v_#memory_int_342|) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_208|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_208|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] and [707] L808-->L810: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 12:03:09,306 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L827: Formula: (and (= (store |v_#memory_int_343| |v_~#y~0.base_208| (store (select |v_#memory_int_343| |v_~#y~0.base_208|) |v_~#y~0.offset_208| 2)) |v_#memory_int_342|) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_208|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_208|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] and [707] L808-->L810: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 12:03:09,323 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [763] $Ultimate##0-->L827: Formula: (and (= (store |v_#memory_int_343| |v_~#y~0.base_208| (store (select |v_#memory_int_343| |v_~#y~0.base_208|) |v_~#y~0.offset_208| 2)) |v_#memory_int_342|) (= v_P3Thread1of1ForFork2_~arg.base_5 |v_P3Thread1of1ForFork2_#in~arg.base_5|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_5| v_P3Thread1of1ForFork2_~arg.offset_5)) InVars {~#y~0.offset=|v_~#y~0.offset_208|, #memory_int=|v_#memory_int_343|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} OutVars{~#y~0.offset=|v_~#y~0.offset_208|, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_5, #memory_int=|v_#memory_int_342|, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_5|, ~#y~0.base=|v_~#y~0.base_208|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_5, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_5|} AuxVars[] AssignedVars[P3Thread1of1ForFork2_~arg.offset, #memory_int, P3Thread1of1ForFork2_~arg.base] and [707] L808-->L810: Formula: (= |v_#memory_int_11| (store |v_#memory_int_12| |v_~#y~0.base_10| (store (select |v_#memory_int_12| |v_~#y~0.base_10|) |v_~#y~0.offset_10| 1))) InVars {#memory_int=|v_#memory_int_12|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} OutVars{#memory_int=|v_#memory_int_11|, ~#y~0.offset=|v_~#y~0.offset_10|, ~#y~0.base=|v_~#y~0.base_10|} AuxVars[] AssignedVars[#memory_int] [2022-12-13 12:03:09,645 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:03:09,646 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3828 [2022-12-13 12:03:09,646 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 92 transitions, 737 flow [2022-12-13 12:03:09,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:09,647 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:09,647 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:09,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 12:03:09,647 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2036989231, now seen corresponding path program 1 times [2022-12-13 12:03:09,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:09,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641980918] [2022-12-13 12:03:09,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:09,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:10,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:10,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641980918] [2022-12-13 12:03:10,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641980918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:10,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:10,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:03:10,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208824571] [2022-12-13 12:03:10,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:10,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:03:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:10,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:03:10,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:03:10,116 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 44 [2022-12-13 12:03:10,116 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 92 transitions, 737 flow. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:10,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:10,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 44 [2022-12-13 12:03:10,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:14,009 INFO L130 PetriNetUnfolder]: 21186/32702 cut-off events. [2022-12-13 12:03:14,010 INFO L131 PetriNetUnfolder]: For 86613/87476 co-relation queries the response was YES. [2022-12-13 12:03:14,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142391 conditions, 32702 events. 21186/32702 cut-off events. For 86613/87476 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 255524 event pairs, 1382 based on Foata normal form. 2463/22003 useless extension candidates. Maximal degree in co-relation 142362. Up to 22357 conditions per place. [2022-12-13 12:03:14,138 INFO L137 encePairwiseOnDemand]: 29/44 looper letters, 109 selfloop transitions, 37 changer transitions 16/170 dead transitions. [2022-12-13 12:03:14,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 170 transitions, 1633 flow [2022-12-13 12:03:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:03:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:03:14,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2022-12-13 12:03:14,157 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6045454545454545 [2022-12-13 12:03:14,157 INFO L175 Difference]: Start difference. First operand has 75 places, 92 transitions, 737 flow. Second operand 5 states and 133 transitions. [2022-12-13 12:03:14,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 170 transitions, 1633 flow [2022-12-13 12:03:14,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 170 transitions, 1600 flow, removed 16 selfloop flow, removed 1 redundant places. [2022-12-13 12:03:14,238 INFO L231 Difference]: Finished difference. Result has 78 places, 93 transitions, 761 flow [2022-12-13 12:03:14,238 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=761, PETRI_PLACES=78, PETRI_TRANSITIONS=93} [2022-12-13 12:03:14,239 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2022-12-13 12:03:14,239 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:14,239 INFO L89 Accepts]: Start accepts. Operand has 78 places, 93 transitions, 761 flow [2022-12-13 12:03:14,240 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:14,240 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:14,240 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 93 transitions, 761 flow [2022-12-13 12:03:14,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 93 transitions, 761 flow [2022-12-13 12:03:15,936 INFO L130 PetriNetUnfolder]: 9054/16037 cut-off events. [2022-12-13 12:03:15,936 INFO L131 PetriNetUnfolder]: For 25905/39696 co-relation queries the response was YES. [2022-12-13 12:03:15,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70678 conditions, 16037 events. 9054/16037 cut-off events. For 25905/39696 co-relation queries the response was YES. Maximal size of possible extension queue 2463. Compared 152374 event pairs, 1220 based on Foata normal form. 41/8162 useless extension candidates. Maximal degree in co-relation 70650. Up to 12619 conditions per place. [2022-12-13 12:03:16,084 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 93 transitions, 761 flow [2022-12-13 12:03:16,084 INFO L226 LiptonReduction]: Number of co-enabled transitions 1882 [2022-12-13 12:03:16,894 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:03:16,895 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2656 [2022-12-13 12:03:16,895 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 93 transitions, 775 flow [2022-12-13 12:03:16,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:16,896 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:16,896 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:16,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 12:03:16,896 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:16,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1981480037, now seen corresponding path program 1 times [2022-12-13 12:03:16,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:16,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708117765] [2022-12-13 12:03:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:17,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708117765] [2022-12-13 12:03:17,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708117765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:17,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:17,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:03:17,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497464249] [2022-12-13 12:03:17,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:17,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:03:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:17,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:03:17,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:03:17,036 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2022-12-13 12:03:17,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 93 transitions, 775 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:17,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:17,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2022-12-13 12:03:17,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:22,352 INFO L130 PetriNetUnfolder]: 31999/51797 cut-off events. [2022-12-13 12:03:22,353 INFO L131 PetriNetUnfolder]: For 148812/157423 co-relation queries the response was YES. [2022-12-13 12:03:22,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258096 conditions, 51797 events. 31999/51797 cut-off events. For 148812/157423 co-relation queries the response was YES. Maximal size of possible extension queue 3711. Compared 457620 event pairs, 3946 based on Foata normal form. 3090/42471 useless extension candidates. Maximal degree in co-relation 258065. Up to 35540 conditions per place. [2022-12-13 12:03:22,595 INFO L137 encePairwiseOnDemand]: 34/39 looper letters, 105 selfloop transitions, 4 changer transitions 57/188 dead transitions. [2022-12-13 12:03:22,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 188 transitions, 1917 flow [2022-12-13 12:03:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:03:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:03:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-12-13 12:03:22,597 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2022-12-13 12:03:22,597 INFO L175 Difference]: Start difference. First operand has 78 places, 93 transitions, 775 flow. Second operand 4 states and 109 transitions. [2022-12-13 12:03:22,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 188 transitions, 1917 flow [2022-12-13 12:03:23,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 188 transitions, 1727 flow, removed 48 selfloop flow, removed 3 redundant places. [2022-12-13 12:03:23,592 INFO L231 Difference]: Finished difference. Result has 79 places, 93 transitions, 686 flow [2022-12-13 12:03:23,592 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=686, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2022-12-13 12:03:23,592 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2022-12-13 12:03:23,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:23,592 INFO L89 Accepts]: Start accepts. Operand has 79 places, 93 transitions, 686 flow [2022-12-13 12:03:23,594 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:23,594 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:23,594 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 93 transitions, 686 flow [2022-12-13 12:03:23,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 93 transitions, 686 flow [2022-12-13 12:03:24,512 INFO L130 PetriNetUnfolder]: 6554/12088 cut-off events. [2022-12-13 12:03:24,512 INFO L131 PetriNetUnfolder]: For 21562/26412 co-relation queries the response was YES. [2022-12-13 12:03:24,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44572 conditions, 12088 events. 6554/12088 cut-off events. For 21562/26412 co-relation queries the response was YES. Maximal size of possible extension queue 1899. Compared 114418 event pairs, 680 based on Foata normal form. 42/5998 useless extension candidates. Maximal degree in co-relation 44543. Up to 8614 conditions per place. [2022-12-13 12:03:24,610 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 93 transitions, 686 flow [2022-12-13 12:03:24,611 INFO L226 LiptonReduction]: Number of co-enabled transitions 1734 [2022-12-13 12:03:24,753 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:03:24,754 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1162 [2022-12-13 12:03:24,754 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 92 transitions, 671 flow [2022-12-13 12:03:24,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:24,754 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:24,754 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:24,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 12:03:24,755 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:24,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1861321610, now seen corresponding path program 1 times [2022-12-13 12:03:24,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:24,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420617327] [2022-12-13 12:03:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:24,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:03:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:03:25,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:03:25,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420617327] [2022-12-13 12:03:25,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420617327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:03:25,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:03:25,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 12:03:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982545136] [2022-12-13 12:03:25,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:03:25,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:03:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:03:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:03:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:03:25,063 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-13 12:03:25,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 92 transitions, 671 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:25,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:03:25,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-13 12:03:25,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:03:26,372 INFO L130 PetriNetUnfolder]: 9787/15375 cut-off events. [2022-12-13 12:03:26,372 INFO L131 PetriNetUnfolder]: For 32910/33345 co-relation queries the response was YES. [2022-12-13 12:03:26,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64945 conditions, 15375 events. 9787/15375 cut-off events. For 32910/33345 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 111836 event pairs, 79 based on Foata normal form. 1682/9914 useless extension candidates. Maximal degree in co-relation 64913. Up to 7048 conditions per place. [2022-12-13 12:03:26,414 INFO L137 encePairwiseOnDemand]: 24/38 looper letters, 54 selfloop transitions, 49 changer transitions 49/156 dead transitions. [2022-12-13 12:03:26,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 156 transitions, 1492 flow [2022-12-13 12:03:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:03:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:03:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2022-12-13 12:03:26,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.618421052631579 [2022-12-13 12:03:26,416 INFO L175 Difference]: Start difference. First operand has 79 places, 92 transitions, 671 flow. Second operand 6 states and 141 transitions. [2022-12-13 12:03:26,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 156 transitions, 1492 flow [2022-12-13 12:03:26,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 156 transitions, 1390 flow, removed 19 selfloop flow, removed 6 redundant places. [2022-12-13 12:03:26,716 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 569 flow [2022-12-13 12:03:26,716 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=569, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2022-12-13 12:03:26,716 INFO L295 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2022-12-13 12:03:26,716 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:03:26,716 INFO L89 Accepts]: Start accepts. Operand has 79 places, 73 transitions, 569 flow [2022-12-13 12:03:26,717 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:03:26,717 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:03:26,717 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 73 transitions, 569 flow [2022-12-13 12:03:26,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 73 transitions, 569 flow [2022-12-13 12:03:26,797 INFO L130 PetriNetUnfolder]: 597/1187 cut-off events. [2022-12-13 12:03:26,798 INFO L131 PetriNetUnfolder]: For 1121/2306 co-relation queries the response was YES. [2022-12-13 12:03:26,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 1187 events. 597/1187 cut-off events. For 1121/2306 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 7245 event pairs, 1 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 4794. Up to 811 conditions per place. [2022-12-13 12:03:26,804 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 73 transitions, 569 flow [2022-12-13 12:03:26,804 INFO L226 LiptonReduction]: Number of co-enabled transitions 746 [2022-12-13 12:03:30,736 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [832] L808-->L859-2: Formula: (and (= (let ((.cse0 (store |v_#memory_int_707| |v_~#y~0.base_334| (store (select |v_#memory_int_707| |v_~#y~0.base_334|) |v_~#y~0.offset_334| 1)))) (store .cse0 |v_ULTIMATE.start_main_~#t2148~0#1.base_30| (store (select .cse0 |v_ULTIMATE.start_main_~#t2148~0#1.base_30|) |v_ULTIMATE.start_main_~#t2148~0#1.offset_30| |v_ULTIMATE.start_main_#t~pre31#1_97|))) |v_#memory_int_705|) (not (= |v_ULTIMATE.start_main_~#t2148~0#1.base_30| 0)) (= |v_#valid_113| (store |v_#valid_114| |v_ULTIMATE.start_main_~#t2148~0#1.base_30| 1)) (= (store |v_#length_101| |v_ULTIMATE.start_main_~#t2148~0#1.base_30| 4) |v_#length_100|) (< |v_#StackHeapBarrier_48| |v_ULTIMATE.start_main_~#t2148~0#1.base_30|) (= |v_#pthreadsForks_82| |v_ULTIMATE.start_main_#t~pre31#1_97|) (= |v_#pthreadsForks_81| (+ |v_#pthreadsForks_82| 1)) (= |v_ULTIMATE.start_main_~#t2148~0#1.offset_30| 0) (= (select |v_#valid_114| |v_ULTIMATE.start_main_~#t2148~0#1.base_30|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_48|, ~#y~0.offset=|v_~#y~0.offset_334|, #pthreadsForks=|v_#pthreadsForks_82|, #valid=|v_#valid_114|, #memory_int=|v_#memory_int_707|, #length=|v_#length_101|, ~#y~0.base=|v_~#y~0.base_334|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_97|, ULTIMATE.start_main_~#t2148~0#1.base=|v_ULTIMATE.start_main_~#t2148~0#1.base_30|, #StackHeapBarrier=|v_#StackHeapBarrier_48|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_39|, ~#y~0.offset=|v_~#y~0.offset_334|, #pthreadsForks=|v_#pthreadsForks_81|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_27|, #valid=|v_#valid_113|, #memory_int=|v_#memory_int_705|, ULTIMATE.start_main_~#t2148~0#1.offset=|v_ULTIMATE.start_main_~#t2148~0#1.offset_30|, #length=|v_#length_100|, ~#y~0.base=|v_~#y~0.base_334|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_main_~#t2148~0#1.base, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, #valid, #memory_int, ULTIMATE.start_main_~#t2148~0#1.offset, #length] and [708] L810-->L818: Formula: (let ((.cse10 (= (mod v_~y$r_buff0_thd3~0_30 256) 0))) (let ((.cse11 (= (mod v_~y$w_buff0_used~0_205 256) 0)) (.cse3 (not .cse10)) (.cse1 (not (= (mod v_~y$w_buff0_used~0_204 256) 0))) (.cse8 (= (mod v_~y$r_buff1_thd3~0_30 256) 0)) (.cse7 (= (mod v_~y$w_buff1_used~0_198 256) 0))) (let ((.cse6 (not .cse7)) (.cse2 (not .cse8)) (.cse0 (and .cse3 .cse1)) (.cse4 (not .cse11)) (.cse9 (select |v_#memory_int_241| |v_~#y~0.base_164|))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_30) v_~y$r_buff0_thd3~0_29) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_29 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_197 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_30) v_~y$r_buff1_thd3~0_29) (let ((.cse5 (= |v_P2Thread1of1ForFork0_#t~mem19_1| |v_P2_#t~mem19_34|))) (or (and .cse3 .cse4 .cse5 (= |v_P2_#t~ite20_25| |v_P2Thread1of1ForFork0_#t~ite20_1|) (= |v_P2_#t~ite21_29| v_~y$w_buff0~0_98)) (and (or (and .cse6 .cse5 .cse2 (= |v_P2_#t~ite20_25| v_~y$w_buff1~0_96)) (and (= |v_P2_#t~ite20_25| |v_P2_#t~mem19_34|) (or .cse7 .cse8) (= (select .cse9 |v_~#y~0.offset_164|) |v_P2_#t~mem19_34|))) (or .cse10 .cse11) (= |v_P2_#t~ite20_25| |v_P2_#t~ite21_29|)))) (= v_~y$w_buff1_used~0_197 (ite (or (and .cse6 .cse2) .cse0) 0 v_~y$w_buff1_used~0_198)) (= v_~y$w_buff0_used~0_204 (ite (and .cse3 .cse4) 0 v_~y$w_buff0_used~0_205)) (= (store |v_#memory_int_241| |v_~#y~0.base_164| (store .cse9 |v_~#y~0.offset_164| |v_P2_#t~ite21_29|)) |v_#memory_int_240|))))) InVars {P2Thread1of1ForFork0_#t~mem19=|v_P2Thread1of1ForFork0_#t~mem19_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_30, ~#y~0.offset=|v_~#y~0.offset_164|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_205, ~y$w_buff1~0=v_~y$w_buff1~0_96, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_98, #memory_int=|v_#memory_int_241|, ~#y~0.base=|v_~#y~0.base_164|, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_198} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_29, ~#y~0.offset=|v_~#y~0.offset_164|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_96, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_29, ~y$w_buff0~0=v_~y$w_buff0~0_98, #memory_int=|v_#memory_int_240|, ~#y~0.base=|v_~#y~0.base_164|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[|v_P2_#t~ite20_25|, |v_P2_#t~mem19_34|, |v_P2_#t~ite21_29|] AssignedVars[P2Thread1of1ForFork0_#t~mem19, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#t~ite21, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, #memory_int, P2Thread1of1ForFork0_#t~ite20, ~y$w_buff1_used~0] [2022-12-13 12:03:32,186 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [830] L857-3-->L859-2: Formula: (and (= (store |v_#length_93| |v_ULTIMATE.start_main_~#t2148~0#1.base_28| 4) |v_#length_92|) (= |v_ULTIMATE.start_main_~#t2148~0#1.offset_28| 0) (= (store |v_#memory_int_451| |v_ULTIMATE.start_main_~#t2148~0#1.base_28| (store (select |v_#memory_int_451| |v_ULTIMATE.start_main_~#t2148~0#1.base_28|) |v_ULTIMATE.start_main_~#t2148~0#1.offset_28| |v_ULTIMATE.start_main_#t~pre31#1_37|)) |v_#memory_int_450|) (= (select |v_#valid_106| |v_ULTIMATE.start_main_~#t2148~0#1.base_28|) 0) (= (store |v_#valid_106| |v_ULTIMATE.start_main_~#t2148~0#1.base_28| 1) |v_#valid_105|) (= |v_#pthreadsForks_74| |v_ULTIMATE.start_main_#t~pre31#1_37|) (< |v_#StackHeapBarrier_44| |v_ULTIMATE.start_main_~#t2148~0#1.base_28|) (not (= |v_ULTIMATE.start_main_~#t2148~0#1.base_28| 0)) (= |v_#pthreadsForks_73| (+ |v_#pthreadsForks_74| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_44|, #pthreadsForks=|v_#pthreadsForks_74|, #valid=|v_#valid_106|, #memory_int=|v_#memory_int_451|, #length=|v_#length_93|} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_37|, ULTIMATE.start_main_~#t2148~0#1.base=|v_ULTIMATE.start_main_~#t2148~0#1.base_28|, #StackHeapBarrier=|v_#StackHeapBarrier_44|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_37|, #pthreadsForks=|v_#pthreadsForks_73|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_25|, #valid=|v_#valid_105|, #memory_int=|v_#memory_int_450|, ULTIMATE.start_main_~#t2148~0#1.offset=|v_ULTIMATE.start_main_~#t2148~0#1.offset_28|, #length=|v_#length_92|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_main_~#t2148~0#1.base, ULTIMATE.start_main_#t~pre29#1, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, #valid, #memory_int, ULTIMATE.start_main_~#t2148~0#1.offset, #length] and [847] L3-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse25 (= (mod v_~y$r_buff0_thd0~0_271 256) 0)) (.cse26 (= (mod v_~y$w_buff0_used~0_573 256) 0))) (let ((.cse18 (not .cse26)) (.cse19 (not .cse25))) (let ((.cse11 (ite (and .cse18 .cse19) 0 v_~y$w_buff0_used~0_573))) (let ((.cse13 (= (mod .cse11 256) 0))) (let ((.cse30 (not .cse13))) (let ((.cse31 (and .cse19 .cse30))) (let ((.cse1 (ite .cse31 0 v_~y$r_buff0_thd0~0_271)) (.cse24 (= (mod v_~y$r_buff1_thd0~0_264 256) 0)) (.cse23 (= (mod v_~y$w_buff1_used~0_564 256) 0))) (let ((.cse21 (not .cse23)) (.cse22 (not .cse24)) (.cse3 (= (mod .cse1 256) 0))) (let ((.cse6 (not .cse3)) (.cse27 (ite (or .cse31 (and .cse21 .cse22)) 0 v_~y$w_buff1_used~0_564))) (let ((.cse29 (= (mod .cse27 256) 0)) (.cse14 (and .cse6 .cse30))) (let ((.cse15 (ite (or (and (not .cse29) .cse22) .cse14) 0 v_~y$r_buff1_thd0~0_264))) (let ((.cse28 (= (mod v_~weak$$choice2~0_180 256) 0)) (.cse17 (= (mod .cse15 256) 0))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_562 256) 0)) (.cse10 (select |v_#memory_int_795| |v_~#y~0.base_364|)) (.cse2 (= (mod v_~y$w_buff0_used~0_571 256) 0)) (.cse12 (and .cse3 .cse29)) (.cse5 (and .cse3 .cse17)) (.cse0 (not .cse28))) (and (= v_~y$r_buff0_thd0~0_269 (ite .cse0 .cse1 (ite (or .cse2 (and .cse3 .cse4) .cse5) .cse1 (ite (and .cse6 (not .cse2)) 0 .cse1)))) (= v_~weak$$choice1~0_166 |v_ULTIMATE.start_main_#t~nondet41#1_143|) (let ((.cse7 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_118 256) 0)) (.cse8 (= |v_ULTIMATE.start_main_#t~mem42#1_216| |v_ULTIMATE.start_main_#t~mem42#1_214|))) (or (and (= |v_ULTIMATE.start_main_#t~ite43#1_215| |v_ULTIMATE.start_main_#t~ite43#1_213|) (= v_~__unbuffered_p0_EAX~0_191 v_~__unbuffered_p0_EAX~0_190) .cse7 .cse8) (and (not .cse7) (= |v_ULTIMATE.start_main_#t~ite43#1_213| v_~__unbuffered_p0_EAX~0_190) (let ((.cse9 (= (mod v_~weak$$choice1~0_166 256) 0))) (or (and .cse9 .cse8 (= |v_ULTIMATE.start_main_#t~ite43#1_213| v_~__unbuffered_p0_EAX~0_191)) (and (not .cse9) (= |v_ULTIMATE.start_main_#t~mem42#1_214| (select (select (store |v_#memory_int_795| |v_~#y~0.base_364| (store .cse10 |v_~#y~0.offset_364| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_121) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_121)) (= |v_ULTIMATE.start_main_#t~mem42#1_214| |v_ULTIMATE.start_main_#t~ite43#1_213|))))))) (= v_~y$w_buff0~0_353 v_~y$w_buff0~0_352) (= 2 v_~x~0_119) (= v_~y$flush_delayed~0_170 0) (= v_~y$mem_tmp~0_136 2) (= |v_ULTIMATE.start_main_#t~nondet36#1_147| v_~weak$$choice0~0_180) (= (store |v_#memory_int_795| |v_~#y~0.base_364| (store .cse10 |v_~#y~0.offset_364| |v_ULTIMATE.start_main_#t~ite48#1_166|)) |v_#memory_int_793|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51| 0) (= v_~y$w_buff0_used~0_571 (ite .cse0 .cse11 (ite (or .cse12 .cse13 .cse5) .cse11 (ite .cse14 0 .cse11)))) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_89) (= 2 v_~__unbuffered_p0_EAX~0_190) |v_ULTIMATE.start_main_#t~short46#1_247|)) 1 0) 0) 0 1) v_~main$tmp_guard1~0_80) (= v_~y$r_buff1_thd0~0_262 (ite .cse0 .cse15 (ite (let ((.cse16 (= 0 (mod v_~y$r_buff0_thd0~0_269 256)))) (or .cse2 (and .cse4 .cse16) (and .cse17 .cse16))) .cse15 0))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| (mod v_~main$tmp_guard1~0_80 256)) (let ((.cse20 (= |v_ULTIMATE.start_main_#t~mem33#1_173| |v_ULTIMATE.start_main_#t~mem33#1_171|))) (or (and .cse18 (= |v_ULTIMATE.start_main_#t~ite34#1_172| |v_ULTIMATE.start_main_#t~ite34#1_170|) .cse19 (= v_~y$mem_tmp~0_136 v_~y$w_buff0~0_353) .cse20) (and (or (and .cse21 (= v_~y$w_buff1~0_349 |v_ULTIMATE.start_main_#t~ite34#1_170|) .cse22 .cse20) (and (or .cse23 .cse24) (= |v_ULTIMATE.start_main_#t~ite34#1_170| |v_ULTIMATE.start_main_#t~mem33#1_171|) (= (select .cse10 |v_~#y~0.offset_364|) |v_ULTIMATE.start_main_#t~mem33#1_171|))) (= v_~y$mem_tmp~0_136 |v_ULTIMATE.start_main_#t~ite34#1_170|) (or .cse25 .cse26)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|) (= (ite .cse0 .cse27 (ite (or .cse2 .cse12 .cse5) .cse27 0)) v_~y$w_buff1_used~0_562) (or (and (= |v_ULTIMATE.start_main_#t~mem47#1_212| |v_ULTIMATE.start_main_#t~ite48#1_166|) .cse28 (= |v_ULTIMATE.start_main_#t~mem47#1_212| 2)) (and .cse0 (= |v_ULTIMATE.start_main_#t~mem47#1_214| |v_ULTIMATE.start_main_#t~mem47#1_212|) (= v_~y$mem_tmp~0_136 |v_ULTIMATE.start_main_#t~ite48#1_166|))) |v_ULTIMATE.start_main_#t~short46#1_248| (= v_~weak$$choice2~0_180 |v_ULTIMATE.start_main_#t~nondet37#1_151|) (= v_~y$w_buff1~0_349 v_~y$w_buff1~0_348))))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_364|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_573, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_172|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_147|, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_214|, ~#y~0.base=|v_~#y~0.base_364|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_121, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_143|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_191, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_173|, ~y$w_buff1~0=v_~y$w_buff1~0_349, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_215|, ~y$w_buff0~0=v_~y$w_buff0~0_353, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_271, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_216|, #memory_int=|v_#memory_int_795|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_121, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_151|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_118, ~x~0=v_~x~0_119, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_264, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_564} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_51|, ~#y~0.offset=|v_~#y~0.offset_364|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_571, ULTIMATE.start_main_#t~short46#1=|v_ULTIMATE.start_main_#t~short46#1_246|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~#y~0.base=|v_~#y~0.base_364|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_134|, ~y$mem_tmp~0=v_~y$mem_tmp~0_136, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_190, ~weak$$choice1~0=v_~weak$$choice1~0_166, ULTIMATE.start_main_#t~ite48#1=|v_ULTIMATE.start_main_#t~ite48#1_165|, ~y$w_buff0~0=v_~y$w_buff0~0_352, ~y$flush_delayed~0=v_~y$flush_delayed~0_170, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_100|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_118, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_223|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_126|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_139|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_121, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_91|, ~weak$$choice0~0=v_~weak$$choice0~0_180, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_47|, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_269, #memory_int=|v_#memory_int_793|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_121, ~weak$$choice2~0=v_~weak$$choice2~0_180, ~x~0=v_~x~0_119, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_262, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_562} AuxVars[|v_ULTIMATE.start_main_#t~short46#1_247|, |v_ULTIMATE.start_main_#t~short46#1_248|, |v_ULTIMATE.start_main_#t~mem33#1_171|, |v_ULTIMATE.start_main_#t~mem42#1_214|, |v_ULTIMATE.start_main_#t~mem47#1_212|, |v_ULTIMATE.start_main_#t~ite34#1_170|, |v_ULTIMATE.start_main_#t~ite48#1_166|, |v_ULTIMATE.start_main_#t~ite43#1_213|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~short46#1, ULTIMATE.start_main_#t~mem47#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start_main_#t~ite48#1, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_#t~mem38#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:03:34,777 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [816] L859-3-->L3-1: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_25| 0)) (= v_~main$tmp_guard0~0_56 (ite (= (ite (= v_~__unbuffered_cnt~0_339 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_339} OutVars{ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_23|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_25|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_339, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre31#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet32#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [852] L857-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse19 (= (mod v_~y$w_buff0_used~0_582 256) 0)) (.cse18 (= (mod v_~y$r_buff0_thd0~0_276 256) 0))) (let ((.cse20 (not .cse18)) (.cse21 (not .cse19))) (let ((.cse1 (ite (and .cse20 .cse21) 0 v_~y$w_buff0_used~0_582))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse31 (not .cse3))) (let ((.cse32 (and .cse31 .cse20))) (let ((.cse8 (ite .cse32 0 v_~y$r_buff0_thd0~0_276)) (.cse14 (= (mod v_~y$w_buff1_used~0_573 256) 0)) (.cse13 (= (mod v_~y$r_buff1_thd0~0_269 256) 0))) (let ((.cse15 (not .cse13)) (.cse16 (not .cse14)) (.cse10 (= (mod .cse8 256) 0))) (let ((.cse11 (not .cse10)) (.cse6 (ite (or .cse32 (and .cse15 .cse16)) 0 v_~y$w_buff1_used~0_573))) (let ((.cse30 (= (mod .cse6 256) 0)) (.cse5 (and .cse31 .cse11))) (let ((.cse26 (ite (or (and .cse15 (not .cse30)) .cse5) 0 v_~y$r_buff1_thd0~0_269))) (let ((.cse29 (= (mod v_~weak$$choice2~0_182 256) 0)) (.cse22 (store |v_#memory_int_807| |v_ULTIMATE.start_main_~#t2148~0#1.base_34| (store (select |v_#memory_int_807| |v_ULTIMATE.start_main_~#t2148~0#1.base_34|) |v_ULTIMATE.start_main_~#t2148~0#1.offset_34| |v_ULTIMATE.start_main_#t~pre31#1_103|))) (.cse28 (= (mod .cse26 256) 0))) (let ((.cse2 (and .cse10 .cse30)) (.cse4 (and .cse10 .cse28)) (.cse12 (select .cse22 |v_~#y~0.base_368|)) (.cse9 (= 0 (mod v_~y$w_buff1_used~0_572 256))) (.cse7 (= (mod v_~y$w_buff0_used~0_581 256) 0)) (.cse0 (not .cse29))) (and (= v_~y$w_buff0_used~0_581 (ite .cse0 .cse1 (ite (or .cse2 .cse3 .cse4) .cse1 (ite .cse5 0 .cse1)))) (= (store |v_#length_109| |v_ULTIMATE.start_main_~#t2148~0#1.base_34| 4) |v_#length_108|) (= v_~y$w_buff1_used~0_572 (ite .cse0 .cse6 (ite (or .cse2 .cse7 .cse4) .cse6 0))) (= v_~y$r_buff0_thd0~0_275 (ite .cse0 .cse8 (ite (or (and .cse9 .cse10) .cse7 .cse4) .cse8 (ite (and (not .cse7) .cse11) 0 .cse8)))) (= |v_ULTIMATE.start_main_~#t2148~0#1.offset_34| 0) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53| 0) (= v_~weak$$choice2~0_182 |v_ULTIMATE.start_main_#t~nondet37#1_155|) (= |v_#pthreadsForks_90| |v_ULTIMATE.start_main_#t~pre31#1_103|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| (mod v_~main$tmp_guard1~0_82 256)) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p0_EAX~0_194) (= 2 v_~__unbuffered_p2_EAX~0_96) |v_ULTIMATE.start_main_#t~short46#1_255|)) 1 0) 0) 0 1) v_~main$tmp_guard1~0_82) (= (+ |v_#pthreadsForks_90| 1) |v_#pthreadsForks_89|) (= v_~y$w_buff0~0_359 v_~y$w_buff0~0_358) (let ((.cse17 (= |v_ULTIMATE.start_main_#t~mem33#1_178| |v_ULTIMATE.start_main_#t~mem33#1_180|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~mem33#1_178| (select .cse12 |v_~#y~0.offset_368|)) (or .cse13 .cse14) (= |v_ULTIMATE.start_main_#t~ite34#1_177| |v_ULTIMATE.start_main_#t~mem33#1_178|)) (and .cse15 .cse16 (= v_~y$w_buff1~0_355 |v_ULTIMATE.start_main_#t~ite34#1_177|) .cse17)) (= v_~y$mem_tmp~0_138 |v_ULTIMATE.start_main_#t~ite34#1_177|) (or .cse18 .cse19)) (and (= v_~y$mem_tmp~0_138 v_~y$w_buff0~0_359) (= |v_ULTIMATE.start_main_#t~ite34#1_179| |v_ULTIMATE.start_main_#t~ite34#1_177|) .cse20 .cse17 .cse21))) (= v_~y$w_buff1~0_355 v_~y$w_buff1~0_354) (= (store .cse22 |v_~#y~0.base_368| (store .cse12 |v_~#y~0.offset_368| |v_ULTIMATE.start_main_#t~ite48#1_171|)) |v_#memory_int_805|) (= |v_#valid_121| (store |v_#valid_122| |v_ULTIMATE.start_main_~#t2148~0#1.base_34| 1)) (let ((.cse23 (= |v_ULTIMATE.start_main_#t~mem42#1_223| |v_ULTIMATE.start_main_#t~mem42#1_221|)) (.cse24 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_120 256) 0))) (or (and .cse23 (= |v_ULTIMATE.start_main_#t~ite43#1_222| |v_ULTIMATE.start_main_#t~ite43#1_220|) .cse24 (= v_~__unbuffered_p0_EAX~0_195 v_~__unbuffered_p0_EAX~0_194)) (and (= |v_ULTIMATE.start_main_#t~ite43#1_220| v_~__unbuffered_p0_EAX~0_194) (let ((.cse25 (= (mod v_~weak$$choice1~0_168 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~mem42#1_221| (select (select (store .cse22 |v_~#y~0.base_368| (store .cse12 |v_~#y~0.offset_368| 2)) v_~__unbuffered_p0_EAX$read_delayed_var~0.base_123) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_123)) (not .cse25) (= |v_ULTIMATE.start_main_#t~mem42#1_221| |v_ULTIMATE.start_main_#t~ite43#1_220|)) (and .cse23 (= |v_ULTIMATE.start_main_#t~ite43#1_220| v_~__unbuffered_p0_EAX~0_195) .cse25))) (not .cse24)))) (not (= |v_ULTIMATE.start_main_~#t2148~0#1.base_34| 0)) (= v_~y$mem_tmp~0_138 2) (= |v_ULTIMATE.start_main_#t~nondet36#1_151| v_~weak$$choice0~0_182) (= v_~y$flush_delayed~0_172 0) (= 2 v_~x~0_136) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|) (= v_~y$r_buff1_thd0~0_268 (ite .cse0 .cse26 (ite (let ((.cse27 (= (mod v_~y$r_buff0_thd0~0_275 256) 0))) (or (and .cse27 .cse9) .cse7 (and .cse27 .cse28))) .cse26 0))) (or (and .cse29 (= |v_ULTIMATE.start_main_#t~mem47#1_219| |v_ULTIMATE.start_main_#t~ite48#1_171|) (= |v_ULTIMATE.start_main_#t~mem47#1_219| 2)) (and .cse0 (= v_~y$mem_tmp~0_138 |v_ULTIMATE.start_main_#t~ite48#1_171|) (= |v_ULTIMATE.start_main_#t~mem47#1_219| |v_ULTIMATE.start_main_#t~mem47#1_221|))) (= (select |v_#valid_122| |v_ULTIMATE.start_main_~#t2148~0#1.base_34|) 0) (< |v_#StackHeapBarrier_52| |v_ULTIMATE.start_main_~#t2148~0#1.base_34|) (= v_~weak$$choice1~0_168 |v_ULTIMATE.start_main_#t~nondet41#1_147|) |v_ULTIMATE.start_main_#t~short46#1_256|)))))))))))))) InVars {~#y~0.offset=|v_~#y~0.offset_368|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_582, ULTIMATE.start_main_#t~mem47#1=|v_ULTIMATE.start_main_#t~mem47#1_221|, ~#y~0.base=|v_~#y~0.base_368|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_195, #pthreadsForks=|v_#pthreadsForks_90|, ~y$w_buff0~0=v_~y$w_buff0~0_359, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, #length=|v_#length_109|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_120, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_179|, ULTIMATE.start_main_#t~nondet36#1=|v_ULTIMATE.start_main_#t~nondet36#1_151|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_123, ULTIMATE.start_main_#t~nondet41#1=|v_ULTIMATE.start_main_#t~nondet41#1_147|, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_180|, ~y$w_buff1~0=v_~y$w_buff1~0_355, ULTIMATE.start_main_#t~ite43#1=|v_ULTIMATE.start_main_#t~ite43#1_222|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_276, ULTIMATE.start_main_#t~mem42#1=|v_ULTIMATE.start_main_#t~mem42#1_223|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_807|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_123, ULTIMATE.start_main_#t~nondet37#1=|v_ULTIMATE.start_main_#t~nondet37#1_155|, ~x~0=v_~x~0_136, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_269, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_573} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_53|, ULTIMATE.start_main_~#t2148~0#1.base=|v_ULTIMATE.start_main_~#t2148~0#1.base_34|, ~#y~0.offset=|v_~#y~0.offset_368|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_581, ULTIMATE.start_main_#t~short46#1=|v_ULTIMATE.start_main_#t~short46#1_254|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_82, ~#y~0.base=|v_~#y~0.base_368|, ULTIMATE.start_main_#t~ite35#1=|v_ULTIMATE.start_main_#t~ite35#1_138|, ~y$mem_tmp~0=v_~y$mem_tmp~0_138, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_194, ~weak$$choice1~0=v_~weak$$choice1~0_168, #pthreadsForks=|v_#pthreadsForks_89|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_31|, ULTIMATE.start_main_#t~ite48#1=|v_ULTIMATE.start_main_#t~ite48#1_170|, ~y$w_buff0~0=v_~y$w_buff0~0_358, ~y$flush_delayed~0=v_~y$flush_delayed~0_172, ULTIMATE.start_main_#t~ite44#1=|v_ULTIMATE.start_main_#t~ite44#1_102|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_96, #length=|v_#length_108|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_120, ULTIMATE.start_main_#t~mem39#1=|v_ULTIMATE.start_main_#t~mem39#1_228|, ULTIMATE.start_main_#t~ite40#1=|v_ULTIMATE.start_main_#t~ite40#1_128|, ULTIMATE.start_main_#t~pre29#1=|v_ULTIMATE.start_main_#t~pre29#1_43|, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_141|, ULTIMATE.start_main_~#t2148~0#1.offset=|v_ULTIMATE.start_main_~#t2148~0#1.offset_34|, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_123, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_93|, ULTIMATE.start_main_#t~pre31#1=|v_ULTIMATE.start_main_#t~pre31#1_103|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_52|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_49|, ~y$w_buff1~0=v_~y$w_buff1~0_354, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, #valid=|v_#valid_121|, #memory_int=|v_#memory_int_805|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_123, ~weak$$choice2~0=v_~weak$$choice2~0_182, ~x~0=v_~x~0_136, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_268, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_572} AuxVars[|v_ULTIMATE.start_main_#t~short46#1_256|, |v_ULTIMATE.start_main_#t~mem47#1_219|, |v_ULTIMATE.start_main_#t~mem42#1_221|, |v_ULTIMATE.start_main_#t~ite34#1_177|, |v_ULTIMATE.start_main_#t~ite43#1_220|, |v_ULTIMATE.start_main_#t~mem33#1_178|, |v_ULTIMATE.start_main_#t~short46#1_255|, |v_ULTIMATE.start_main_#t~ite48#1_171|] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_~#t2148~0#1.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~short46#1, ULTIMATE.start_main_#t~mem47#1, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite35#1, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, #pthreadsForks, ULTIMATE.start_main_#t~nondet30#1, ULTIMATE.start_main_#t~ite48#1, ~y$w_buff0~0, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite44#1, #length, ULTIMATE.start_main_#t~mem39#1, ULTIMATE.start_main_#t~ite40#1, ULTIMATE.start_main_#t~pre29#1, ULTIMATE.start_main_#t~ite34#1, ULTIMATE.start_main_#t~mem45#1, ULTIMATE.start_main_#t~nondet36#1, ULTIMATE.start_main_~#t2148~0#1.offset, ULTIMATE.start_main_#t~mem38#1, ULTIMATE.start_main_#t~pre31#1, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet41#1, ULTIMATE.start_main_#t~mem33#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite43#1, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem42#1, #valid, #memory_int, ULTIMATE.start_main_#t~nondet37#1, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] [2022-12-13 12:03:37,704 INFO L241 LiptonReduction]: Total number of compositions: 6 [2022-12-13 12:03:37,705 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10989 [2022-12-13 12:03:37,705 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 575 flow [2022-12-13 12:03:37,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:03:37,705 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:03:37,705 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:37,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 12:03:37,706 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 12:03:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:03:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1266066351, now seen corresponding path program 1 times [2022-12-13 12:03:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:03:37,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594949120] [2022-12-13 12:03:37,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:03:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:03:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:03:37,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:03:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:03:38,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:03:38,060 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:03:38,060 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 12:03:38,063 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-13 12:03:38,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 12:03:38,064 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 12:03:38,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-13 12:03:38,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 12:03:38,066 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:03:38,070 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:03:38,070 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:03:38,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:03:38 BasicIcfg [2022-12-13 12:03:38,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:03:38,213 INFO L158 Benchmark]: Toolchain (without parser) took 89233.08ms. Allocated memory was 182.5MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 157.0MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-13 12:03:38,213 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory was 159.0MB in the beginning and 158.9MB in the end (delta: 90.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:03:38,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 619.94ms. Allocated memory is still 182.5MB. Free memory was 157.0MB in the beginning and 128.0MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-13 12:03:38,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.13ms. Allocated memory is still 182.5MB. Free memory was 128.0MB in the beginning and 125.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:03:38,214 INFO L158 Benchmark]: Boogie Preprocessor took 45.95ms. Allocated memory is still 182.5MB. Free memory was 125.0MB in the beginning and 122.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 12:03:38,214 INFO L158 Benchmark]: RCFGBuilder took 1056.95ms. Allocated memory was 182.5MB in the beginning and 231.7MB in the end (delta: 49.3MB). Free memory was 122.5MB in the beginning and 158.3MB in the end (delta: -35.9MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2022-12-13 12:03:38,215 INFO L158 Benchmark]: TraceAbstraction took 87466.18ms. Allocated memory was 231.7MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 157.3MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-12-13 12:03:38,217 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory was 159.0MB in the beginning and 158.9MB in the end (delta: 90.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 619.94ms. Allocated memory is still 182.5MB. Free memory was 157.0MB in the beginning and 128.0MB in the end (delta: 29.0MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.13ms. Allocated memory is still 182.5MB. Free memory was 128.0MB in the beginning and 125.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.95ms. Allocated memory is still 182.5MB. Free memory was 125.0MB in the beginning and 122.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1056.95ms. Allocated memory was 182.5MB in the beginning and 231.7MB in the end (delta: 49.3MB). Free memory was 122.5MB in the beginning and 158.3MB in the end (delta: -35.9MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. * TraceAbstraction took 87466.18ms. Allocated memory was 231.7MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 157.3MB in the beginning and 4.8GB in the end (delta: -4.7GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 136 PlacesBefore, 48 PlacesAfterwards, 124 TransitionsBefore, 36 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 40 ConcurrentYvCompositions, 0 ChoiceCompositions, 102 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2422, independent: 2306, independent conditional: 2306, independent unconditional: 0, dependent: 116, dependent conditional: 116, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2422, independent: 2306, independent conditional: 0, independent unconditional: 2306, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2422, independent: 2306, independent conditional: 0, independent unconditional: 2306, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2422, independent: 2306, independent conditional: 0, independent unconditional: 2306, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1428, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1428, independent: 1329, independent conditional: 0, independent unconditional: 1329, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 99, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 450, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 404, dependent conditional: 0, dependent unconditional: 404, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2422, independent: 935, independent conditional: 0, independent unconditional: 935, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 1428, unknown conditional: 0, unknown unconditional: 1428] , Statistics on independence cache: Total cache size (in pairs): 2241, Positive cache size: 2184, Positive conditional cache size: 0, Positive unconditional cache size: 2184, Negative cache size: 57, Negative conditional cache size: 0, Negative unconditional cache size: 57, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 269, independent: 233, independent conditional: 233, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 269, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 269, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 269, independent: 233, independent conditional: 0, independent unconditional: 233, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 241, independent: 215, independent conditional: 0, independent unconditional: 215, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 241, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 86, independent: 60, independent conditional: 0, independent unconditional: 60, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 349, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 296, dependent conditional: 0, dependent unconditional: 296, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 269, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 241, unknown conditional: 0, unknown unconditional: 241] , Statistics on independence cache: Total cache size (in pairs): 241, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 784 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 188, independent: 165, independent conditional: 165, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 188, independent: 165, independent conditional: 14, independent unconditional: 151, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 188, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 188, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 167, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 188, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 240, Positive conditional cache size: 0, Positive unconditional cache size: 240, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 180, independent: 158, independent conditional: 158, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 180, independent: 158, independent conditional: 17, independent unconditional: 141, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 180, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 180, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 180, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 278, Positive cache size: 245, Positive conditional cache size: 0, Positive unconditional cache size: 245, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 17, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 776 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 21, independent unconditional: 109, dependent: 21, dependent conditional: 3, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ 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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 101, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 101, dependent conditional: 0, dependent unconditional: 101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 151, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 249, Positive conditional cache size: 0, Positive unconditional cache size: 249, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 130, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 20, independent unconditional: 110, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 151, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 151, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, 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: 151, independent: 130, independent conditional: 0, independent unconditional: 130, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 289, Positive cache size: 249, Positive conditional cache size: 0, Positive unconditional cache size: 249, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 828 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, independent: 146, independent conditional: 146, 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: 165, independent: 146, independent conditional: 20, independent unconditional: 126, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, independent: 146, independent conditional: 0, independent unconditional: 146, dependent: 19, dependent conditional: 1, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 1, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, independent: 143, independent conditional: 0, independent unconditional: 143, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 6, unknown conditional: 1, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 956 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 6, independent unconditional: 10, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 3, dependent conditional: 1, dependent unconditional: 2, 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: 19, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 295, Positive cache size: 252, Positive conditional cache size: 0, Positive unconditional cache size: 252, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 64 PlacesBefore, 63 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 1166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 110, independent conditional: 110, 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: 124, independent: 110, independent conditional: 78, independent unconditional: 32, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 110, independent conditional: 70, independent unconditional: 40, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 110, independent conditional: 70, independent unconditional: 40, dependent: 14, dependent conditional: 10, 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: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 104, independent conditional: 64, independent unconditional: 40, dependent: 14, dependent conditional: 10, dependent unconditional: 4, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 286, Positive conditional cache size: 6, Positive unconditional cache size: 280, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 30, independent conditional: 17, independent unconditional: 13, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 30, independent conditional: 9, independent unconditional: 21, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 30, independent conditional: 9, independent unconditional: 21, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 30, independent conditional: 9, independent unconditional: 21, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 286, Positive conditional cache size: 6, Positive unconditional cache size: 280, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 22, independent conditional: 13, independent unconditional: 9, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 22, independent conditional: 9, independent unconditional: 13, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 22, independent conditional: 9, independent unconditional: 13, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 22, independent conditional: 9, independent unconditional: 13, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 286, Positive conditional cache size: 6, Positive unconditional cache size: 280, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 67 PlacesBefore, 67 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1768 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 15, independent conditional: 5, independent unconditional: 10, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 329, Positive cache size: 286, Positive conditional cache size: 6, Positive unconditional cache size: 280, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 70 PlacesBefore, 70 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 2014 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 57, independent conditional: 57, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 57, independent conditional: 37, independent unconditional: 20, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 57, independent conditional: 34, independent unconditional: 23, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 57, independent conditional: 34, independent unconditional: 23, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 18, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 66, independent: 32, independent conditional: 16, independent unconditional: 16, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 25, unknown conditional: 18, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 358, Positive cache size: 315, Positive conditional cache size: 24, Positive unconditional cache size: 291, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 74 PlacesBefore, 75 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 2226 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 252, independent: 240, independent conditional: 240, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 252, independent: 240, independent conditional: 228, independent unconditional: 12, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 252, independent: 240, independent conditional: 210, independent unconditional: 30, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 252, independent: 240, independent conditional: 210, independent unconditional: 30, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 7, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 252, independent: 231, independent conditional: 203, independent unconditional: 28, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 9, unknown conditional: 7, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 399, Positive cache size: 356, Positive conditional cache size: 31, Positive unconditional cache size: 325, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, 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.8s, 78 PlacesBefore, 78 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1882 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 108, independent conditional: 108, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 114, independent: 108, independent conditional: 90, independent unconditional: 18, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 114, independent: 108, independent conditional: 84, independent unconditional: 24, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114, independent: 108, independent conditional: 84, independent unconditional: 24, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 21, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 25, independent conditional: 0, independent unconditional: 25, 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: 114, independent: 83, independent conditional: 63, independent unconditional: 20, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 25, unknown conditional: 21, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 391, Positive conditional cache size: 52, Positive unconditional cache size: 339, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 79 PlacesBefore, 79 PlacesAfterwards, 93 TransitionsBefore, 92 TransitionsAfterwards, 1734 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 170, independent: 164, independent conditional: 164, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 176, independent: 164, independent conditional: 85, independent unconditional: 79, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 176, independent: 164, independent conditional: 85, independent unconditional: 79, dependent: 12, dependent conditional: 6, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 176, independent: 162, independent conditional: 85, independent unconditional: 77, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 438, Positive cache size: 393, Positive conditional cache size: 52, Positive unconditional cache size: 341, Negative cache size: 45, Negative conditional cache size: 2, Negative unconditional cache size: 43, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 85, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.9s, 77 PlacesBefore, 73 PlacesAfterwards, 73 TransitionsBefore, 69 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 417, independent: 390, independent conditional: 390, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 417, independent: 390, independent conditional: 390, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 444, independent: 390, independent conditional: 202, independent unconditional: 188, dependent: 54, dependent conditional: 27, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444, independent: 390, independent conditional: 202, independent unconditional: 188, dependent: 54, dependent conditional: 27, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, independent: 43, independent conditional: 37, independent unconditional: 6, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 444, independent: 347, independent conditional: 165, independent unconditional: 182, dependent: 52, dependent conditional: 26, dependent unconditional: 26, unknown: 45, unknown conditional: 38, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 541, Positive cache size: 494, Positive conditional cache size: 89, Positive unconditional cache size: 405, Negative cache size: 47, Negative conditional cache size: 3, Negative unconditional cache size: 44, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 215, Maximal queried relation: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2145, ((void *)0), P0, ((void *)0))=0, t2145={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={3: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] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y={3: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] [L854] 0 pthread_t t2146; [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2146, ((void *)0), P1, ((void *)0))=1, t2145={5:0}, t2146={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y={3: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] [L856] 0 pthread_t t2147; [L783] 1 x = 1 [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y={3: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] [L795] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2147, ((void *)0), P2, ((void *)0))=2, t2145={5:0}, t2146={8:0}, t2147={9:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L858] 0 pthread_t t2148; [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2148, ((void *)0), P3, ((void *)0))=3, t2145={5:0}, t2146={8:0}, t2147={9:0}, t2148={10:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L810] 3 y = 1 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 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) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 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 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L827] 4 y = 2 [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 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) [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=2, y={3: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] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 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) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 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 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 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 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !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) [L876] EXPR 0 \read(y) [L876] EXPR 0 !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) [L876] 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) [L877] 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)) [L878] 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)) [L879] 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)) [L880] 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)) [L881] 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)) [L882] 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)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=2, y={3:0}, 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=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] - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 859]: 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: 855]: 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, 173 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 87.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 45.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 507 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 157 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1358 IncrementalHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 157 mSolverCounterUnsat, 5 mSDtfsCounter, 1358 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=775occurred in iteration=14, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 253 NumberOfCodeBlocks, 253 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 1879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:03:38,255 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...