/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/mix016_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 11:46:49,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:46:49,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:46:49,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:46:49,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:46:49,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:46:49,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:46:49,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:46:49,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:46:49,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:46:49,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:46:49,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:46:49,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:46:49,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:46:49,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:46:49,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:46:49,652 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:46:49,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:46:49,654 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:46:49,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:46:49,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:46:49,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:46:49,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:46:49,661 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:46:49,663 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:46:49,663 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:46:49,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:46:49,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:46:49,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:46:49,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:46:49,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:46:49,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:46:49,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:46:49,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:46:49,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:46:49,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:46:49,669 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:46:49,669 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:46:49,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:46:49,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:46:49,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:46:49,671 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 11:46:49,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:46:49,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:46:49,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:46:49,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:46:49,698 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:46:49,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:46:49,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:46:49,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:46:49,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:46:49,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:46:49,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:46:49,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:46:49,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:46:49,700 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:46:49,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:46:49,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:46:49,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:46:49,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:46:49,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:46:49,701 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 11:46:49,701 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 11:46:49,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:46:49,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:46:49,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:46:49,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:46:49,985 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:46:49,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-12-13 11:46:50,969 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:46:51,175 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:46:51,176 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix016_power.opt_rmo.opt.i [2022-12-13 11:46:51,186 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0975938/6e419446e0b940949effa6ea2f83c747/FLAG511369d3c [2022-12-13 11:46:51,195 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc0975938/6e419446e0b940949effa6ea2f83c747 [2022-12-13 11:46:51,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:46:51,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 11:46:51,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:46:51,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:46:51,200 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:46:51,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27aee550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51, skipping insertion in model container [2022-12-13 11:46:51,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:46:51,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:46:51,329 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/mix016_power.opt_rmo.opt.i[1001,1014] [2022-12-13 11:46:51,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:46:51,478 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:46:51,485 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/mix016_power.opt_rmo.opt.i[1001,1014] [2022-12-13 11:46:51,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,506 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,510 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,513 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 11:46:51,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 11:46:51,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:46:51,550 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:46:51,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51 WrapperNode [2022-12-13 11:46:51,550 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:46:51,551 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:46:51,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:46:51,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:46:51,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,592 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,617 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2022-12-13 11:46:51,618 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:46:51,619 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:46:51,619 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:46:51,620 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:46:51,626 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,651 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:46:51,654 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:46:51,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:46:51,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:46:51,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (1/1) ... [2022-12-13 11:46:51,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:46:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 11:46:51,713 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 11:46:51,731 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 11:46:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:46:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 11:46:51,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:46:51,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 11:46:51,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:46:51,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 11:46:51,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 11:46:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 11:46:51,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 11:46:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 11:46:51,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 11:46:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:46:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 11:46:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:46:51,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:46:51,758 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 11:46:51,862 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 11:46:51,864 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:46:52,117 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 11:46:52,221 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:46:52,221 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 11:46:52,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:46:52 BoogieIcfgContainer [2022-12-13 11:46:52,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:46:52,225 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:46:52,225 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:46:52,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:46:52,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:46:51" (1/3) ... [2022-12-13 11:46:52,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411fbba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:46:52, skipping insertion in model container [2022-12-13 11:46:52,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:46:51" (2/3) ... [2022-12-13 11:46:52,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@411fbba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:46:52, skipping insertion in model container [2022-12-13 11:46:52,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:46:52" (3/3) ... [2022-12-13 11:46:52,236 INFO L112 eAbstractionObserver]: Analyzing ICFG mix016_power.opt_rmo.opt.i [2022-12-13 11:46:52,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:46:52,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:46:52,265 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 11:46:52,323 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 11:46:52,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 11:46:52,387 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 11:46:52,387 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:52,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 11:46:52,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-13 11:46:52,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-13 11:46:52,394 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:52,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 11:46:52,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-13 11:46:52,453 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-13 11:46:52,453 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:52,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 11:46:52,456 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-13 11:46:52,456 INFO L226 LiptonReduction]: Number of co-enabled transitions 1876 [2022-12-13 11:46:56,570 INFO L241 LiptonReduction]: Total number of compositions: 87 [2022-12-13 11:46:56,590 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:46:56,596 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;@75a51f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 11:46:56,596 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 11:46:56,599 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-13 11:46:56,599 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:56,600 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:56,600 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 11:46:56,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash 467875747, now seen corresponding path program 1 times [2022-12-13 11:46:56,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:56,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924937526] [2022-12-13 11:46:56,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:56,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:56,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924937526] [2022-12-13 11:46:56,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924937526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:56,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:56,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805296649] [2022-12-13 11:46:56,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:56,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:56,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:56,902 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 61 [2022-12-13 11:46:56,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 131 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 11:46:56,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:56,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 61 [2022-12-13 11:46:56,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:57,877 INFO L130 PetriNetUnfolder]: 7624/12269 cut-off events. [2022-12-13 11:46:57,877 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-13 11:46:57,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23246 conditions, 12269 events. 7624/12269 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 90675 event pairs, 1008 based on Foata normal form. 0/7522 useless extension candidates. Maximal degree in co-relation 23235. Up to 9237 conditions per place. [2022-12-13 11:46:57,907 INFO L137 encePairwiseOnDemand]: 56/61 looper letters, 32 selfloop transitions, 2 changer transitions 50/96 dead transitions. [2022-12-13 11:46:57,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 96 transitions, 372 flow [2022-12-13 11:46:57,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-12-13 11:46:57,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6830601092896175 [2022-12-13 11:46:57,918 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 131 flow. Second operand 3 states and 125 transitions. [2022-12-13 11:46:57,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 96 transitions, 372 flow [2022-12-13 11:46:57,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 368 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 11:46:57,924 INFO L231 Difference]: Finished difference. Result has 67 places, 33 transitions, 76 flow [2022-12-13 11:46:57,925 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=67, PETRI_TRANSITIONS=33} [2022-12-13 11:46:57,928 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2022-12-13 11:46:57,928 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:57,929 INFO L89 Accepts]: Start accepts. Operand has 67 places, 33 transitions, 76 flow [2022-12-13 11:46:57,930 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:57,930 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:57,931 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 33 transitions, 76 flow [2022-12-13 11:46:57,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 76 flow [2022-12-13 11:46:57,935 INFO L130 PetriNetUnfolder]: 0/33 cut-off events. [2022-12-13 11:46:57,936 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:57,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 11:46:57,937 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 33 transitions, 76 flow [2022-12-13 11:46:57,938 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 11:46:58,031 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:58,033 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 105 [2022-12-13 11:46:58,033 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 76 flow [2022-12-13 11:46:58,033 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 11:46:58,033 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:58,033 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:58,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:46:58,034 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:58,034 INFO L85 PathProgramCache]: Analyzing trace with hash -2076140133, now seen corresponding path program 1 times [2022-12-13 11:46:58,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:58,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654620236] [2022-12-13 11:46:58,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:58,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:58,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654620236] [2022-12-13 11:46:58,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654620236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:58,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:58,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:58,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148632277] [2022-12-13 11:46:58,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:58,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:58,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:58,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:58,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:58,145 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:46:58,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 76 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 11:46:58,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:58,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:46:58,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:58,429 INFO L130 PetriNetUnfolder]: 2488/3806 cut-off events. [2022-12-13 11:46:58,430 INFO L131 PetriNetUnfolder]: For 179/179 co-relation queries the response was YES. [2022-12-13 11:46:58,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7664 conditions, 3806 events. 2488/3806 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 19161 event pairs, 1087 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 7654. Up to 3506 conditions per place. [2022-12-13 11:46:58,445 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 32 selfloop transitions, 4 changer transitions 2/46 dead transitions. [2022-12-13 11:46:58,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 184 flow [2022-12-13 11:46:58,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 11:46:58,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2022-12-13 11:46:58,447 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 76 flow. Second operand 3 states and 63 transitions. [2022-12-13 11:46:58,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 184 flow [2022-12-13 11:46:58,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:58,449 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 96 flow [2022-12-13 11:46:58,449 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2022-12-13 11:46:58,449 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -27 predicate places. [2022-12-13 11:46:58,449 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:58,450 INFO L89 Accepts]: Start accepts. Operand has 43 places, 35 transitions, 96 flow [2022-12-13 11:46:58,450 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:58,450 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:58,450 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 96 flow [2022-12-13 11:46:58,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 96 flow [2022-12-13 11:46:58,457 INFO L130 PetriNetUnfolder]: 14/93 cut-off events. [2022-12-13 11:46:58,457 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 11:46:58,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 93 events. 14/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 366 event pairs, 6 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 126. Up to 29 conditions per place. [2022-12-13 11:46:58,458 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 35 transitions, 96 flow [2022-12-13 11:46:58,458 INFO L226 LiptonReduction]: Number of co-enabled transitions 604 [2022-12-13 11:46:58,469 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:58,470 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-13 11:46:58,470 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 96 flow [2022-12-13 11:46:58,470 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 11:46:58,470 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:58,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:58,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:46:58,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:58,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:58,471 INFO L85 PathProgramCache]: Analyzing trace with hash -847654052, now seen corresponding path program 1 times [2022-12-13 11:46:58,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:58,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764886762] [2022-12-13 11:46:58,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:58,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:58,586 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 11:46:58,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:58,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764886762] [2022-12-13 11:46:58,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764886762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:58,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:58,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 11:46:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125495617] [2022-12-13 11:46:58,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:58,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:46:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:46:58,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:46:58,588 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2022-12-13 11:46:58,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 96 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 11:46:58,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:58,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2022-12-13 11:46:58,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:58,755 INFO L130 PetriNetUnfolder]: 1481/2412 cut-off events. [2022-12-13 11:46:58,755 INFO L131 PetriNetUnfolder]: For 293/293 co-relation queries the response was YES. [2022-12-13 11:46:58,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 2412 events. 1481/2412 cut-off events. For 293/293 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12547 event pairs, 471 based on Foata normal form. 52/2062 useless extension candidates. Maximal degree in co-relation 5078. Up to 1537 conditions per place. [2022-12-13 11:46:58,767 INFO L137 encePairwiseOnDemand]: 29/32 looper letters, 31 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2022-12-13 11:46:58,767 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 186 flow [2022-12-13 11:46:58,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:46:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 11:46:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-12-13 11:46:58,768 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 11:46:58,768 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 96 flow. Second operand 3 states and 63 transitions. [2022-12-13 11:46:58,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 186 flow [2022-12-13 11:46:58,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 11:46:58,769 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 103 flow [2022-12-13 11:46:58,770 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2022-12-13 11:46:58,770 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -26 predicate places. [2022-12-13 11:46:58,770 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:58,770 INFO L89 Accepts]: Start accepts. Operand has 44 places, 35 transitions, 103 flow [2022-12-13 11:46:58,771 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:58,771 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:58,771 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 103 flow [2022-12-13 11:46:58,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 103 flow [2022-12-13 11:46:58,776 INFO L130 PetriNetUnfolder]: 9/66 cut-off events. [2022-12-13 11:46:58,776 INFO L131 PetriNetUnfolder]: For 6/9 co-relation queries the response was YES. [2022-12-13 11:46:58,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 66 events. 9/66 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 237 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 100. Up to 21 conditions per place. [2022-12-13 11:46:58,776 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 103 flow [2022-12-13 11:46:58,777 INFO L226 LiptonReduction]: Number of co-enabled transitions 600 [2022-12-13 11:46:58,784 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:46:58,785 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-13 11:46:58,785 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 103 flow [2022-12-13 11:46:58,785 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 11:46:58,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:58,786 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:58,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:46:58,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:58,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:58,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1956113731, now seen corresponding path program 1 times [2022-12-13 11:46:58,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:58,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669858098] [2022-12-13 11:46:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:58,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:58,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669858098] [2022-12-13 11:46:58,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669858098] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:58,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:58,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:46:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431144717] [2022-12-13 11:46:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:58,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:46:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:46:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:46:58,878 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 11:46:58,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:58,879 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:58,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 11:46:58,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:59,136 INFO L130 PetriNetUnfolder]: 2314/3638 cut-off events. [2022-12-13 11:46:59,136 INFO L131 PetriNetUnfolder]: For 394/409 co-relation queries the response was YES. [2022-12-13 11:46:59,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 3638 events. 2314/3638 cut-off events. For 394/409 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 20909 event pairs, 186 based on Foata normal form. 272/2727 useless extension candidates. Maximal degree in co-relation 7965. Up to 1972 conditions per place. [2022-12-13 11:46:59,151 INFO L137 encePairwiseOnDemand]: 20/32 looper letters, 49 selfloop transitions, 11 changer transitions 0/70 dead transitions. [2022-12-13 11:46:59,151 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 70 transitions, 301 flow [2022-12-13 11:46:59,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:46:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 11:46:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 11:46:59,152 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7265625 [2022-12-13 11:46:59,153 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 103 flow. Second operand 4 states and 93 transitions. [2022-12-13 11:46:59,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 70 transitions, 301 flow [2022-12-13 11:46:59,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:59,154 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 183 flow [2022-12-13 11:46:59,154 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2022-12-13 11:46:59,155 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -23 predicate places. [2022-12-13 11:46:59,155 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:59,155 INFO L89 Accepts]: Start accepts. Operand has 47 places, 45 transitions, 183 flow [2022-12-13 11:46:59,156 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:59,156 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:59,156 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 45 transitions, 183 flow [2022-12-13 11:46:59,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 45 transitions, 183 flow [2022-12-13 11:46:59,210 INFO L130 PetriNetUnfolder]: 437/876 cut-off events. [2022-12-13 11:46:59,210 INFO L131 PetriNetUnfolder]: For 146/173 co-relation queries the response was YES. [2022-12-13 11:46:59,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 876 events. 437/876 cut-off events. For 146/173 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 5863 event pairs, 169 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1939. Up to 712 conditions per place. [2022-12-13 11:46:59,214 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 45 transitions, 183 flow [2022-12-13 11:46:59,214 INFO L226 LiptonReduction]: Number of co-enabled transitions 744 [2022-12-13 11:46:59,426 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:46:59,427 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 272 [2022-12-13 11:46:59,427 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 185 flow [2022-12-13 11:46:59,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:59,428 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:46:59,428 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:46:59,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:46:59,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:46:59,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:46:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1139196339, now seen corresponding path program 1 times [2022-12-13 11:46:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:46:59,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159595238] [2022-12-13 11:46:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:46:59,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:46:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:46:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:46:59,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:46:59,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159595238] [2022-12-13 11:46:59,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159595238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:46:59,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:46:59,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:46:59,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906613408] [2022-12-13 11:46:59,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:46:59,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:46:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:46:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:46:59,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:46:59,604 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:46:59,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:46:59,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:46:59,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:46:59,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:46:59,865 INFO L130 PetriNetUnfolder]: 1315/2308 cut-off events. [2022-12-13 11:46:59,865 INFO L131 PetriNetUnfolder]: For 712/712 co-relation queries the response was YES. [2022-12-13 11:46:59,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 2308 events. 1315/2308 cut-off events. For 712/712 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13691 event pairs, 63 based on Foata normal form. 231/1835 useless extension candidates. Maximal degree in co-relation 6892. Up to 1114 conditions per place. [2022-12-13 11:46:59,877 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 57 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2022-12-13 11:46:59,877 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 87 transitions, 470 flow [2022-12-13 11:46:59,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:46:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:46:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-13 11:46:59,879 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2022-12-13 11:46:59,879 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 185 flow. Second operand 5 states and 118 transitions. [2022-12-13 11:46:59,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 87 transitions, 470 flow [2022-12-13 11:46:59,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 87 transitions, 454 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 11:46:59,896 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 296 flow [2022-12-13 11:46:59,896 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2022-12-13 11:46:59,897 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -19 predicate places. [2022-12-13 11:46:59,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:46:59,897 INFO L89 Accepts]: Start accepts. Operand has 51 places, 54 transitions, 296 flow [2022-12-13 11:46:59,898 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:46:59,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:46:59,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 54 transitions, 296 flow [2022-12-13 11:46:59,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 54 transitions, 296 flow [2022-12-13 11:46:59,980 INFO L130 PetriNetUnfolder]: 302/716 cut-off events. [2022-12-13 11:46:59,980 INFO L131 PetriNetUnfolder]: For 381/453 co-relation queries the response was YES. [2022-12-13 11:46:59,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 716 events. 302/716 cut-off events. For 381/453 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 5010 event pairs, 37 based on Foata normal form. 4/373 useless extension candidates. Maximal degree in co-relation 2312. Up to 544 conditions per place. [2022-12-13 11:46:59,985 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 54 transitions, 296 flow [2022-12-13 11:46:59,985 INFO L226 LiptonReduction]: Number of co-enabled transitions 756 [2022-12-13 11:47:00,171 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:00,172 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 275 [2022-12-13 11:47:00,172 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 300 flow [2022-12-13 11:47:00,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:00,172 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:00,172 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 11:47:00,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:47:00,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:47:00,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:00,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1207551117, now seen corresponding path program 1 times [2022-12-13 11:47:00,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:00,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210312945] [2022-12-13 11:47:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:00,337 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 11:47:00,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:00,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210312945] [2022-12-13 11:47:00,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210312945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:00,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:00,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:47:00,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440971722] [2022-12-13 11:47:00,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:00,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:47:00,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:00,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:47:00,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:47:00,338 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2022-12-13 11:47:00,338 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:00,338 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:00,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2022-12-13 11:47:00,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:00,605 INFO L130 PetriNetUnfolder]: 1391/2588 cut-off events. [2022-12-13 11:47:00,606 INFO L131 PetriNetUnfolder]: For 3017/3326 co-relation queries the response was YES. [2022-12-13 11:47:00,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9505 conditions, 2588 events. 1391/2588 cut-off events. For 3017/3326 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 16437 event pairs, 173 based on Foata normal form. 231/2397 useless extension candidates. Maximal degree in co-relation 9488. Up to 1462 conditions per place. [2022-12-13 11:47:00,618 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 83 selfloop transitions, 11 changer transitions 4/112 dead transitions. [2022-12-13 11:47:00,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 112 transitions, 797 flow [2022-12-13 11:47:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:47:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:47:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-13 11:47:00,619 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2022-12-13 11:47:00,619 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 300 flow. Second operand 5 states and 109 transitions. [2022-12-13 11:47:00,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 112 transitions, 797 flow [2022-12-13 11:47:00,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 112 transitions, 685 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-13 11:47:00,633 INFO L231 Difference]: Finished difference. Result has 53 places, 59 transitions, 304 flow [2022-12-13 11:47:00,633 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=53, PETRI_TRANSITIONS=59} [2022-12-13 11:47:00,633 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2022-12-13 11:47:00,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:00,633 INFO L89 Accepts]: Start accepts. Operand has 53 places, 59 transitions, 304 flow [2022-12-13 11:47:00,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:00,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:00,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 59 transitions, 304 flow [2022-12-13 11:47:00,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 59 transitions, 304 flow [2022-12-13 11:47:00,681 INFO L130 PetriNetUnfolder]: 400/1001 cut-off events. [2022-12-13 11:47:00,681 INFO L131 PetriNetUnfolder]: For 418/513 co-relation queries the response was YES. [2022-12-13 11:47:00,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 1001 events. 400/1001 cut-off events. For 418/513 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 7750 event pairs, 55 based on Foata normal form. 8/580 useless extension candidates. Maximal degree in co-relation 2804. Up to 703 conditions per place. [2022-12-13 11:47:00,687 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 59 transitions, 304 flow [2022-12-13 11:47:00,687 INFO L226 LiptonReduction]: Number of co-enabled transitions 840 [2022-12-13 11:47:00,697 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:47:00,698 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 11:47:00,698 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 304 flow [2022-12-13 11:47:00,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:00,698 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:00,698 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 11:47:00,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:47:00,698 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:47:00,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:00,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1774195049, now seen corresponding path program 2 times [2022-12-13 11:47:00,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:00,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512577107] [2022-12-13 11:47:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:47:00,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:00,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512577107] [2022-12-13 11:47:00,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512577107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:00,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:00,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:47:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625636361] [2022-12-13 11:47:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:00,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:47:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:47:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:47:00,811 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 11:47:00,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 59 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:00,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:00,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 11:47:00,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:01,150 INFO L130 PetriNetUnfolder]: 1831/3379 cut-off events. [2022-12-13 11:47:01,151 INFO L131 PetriNetUnfolder]: For 3455/3664 co-relation queries the response was YES. [2022-12-13 11:47:01,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11521 conditions, 3379 events. 1831/3379 cut-off events. For 3455/3664 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 22630 event pairs, 326 based on Foata normal form. 218/3020 useless extension candidates. Maximal degree in co-relation 11503. Up to 1604 conditions per place. [2022-12-13 11:47:01,161 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 71 selfloop transitions, 9 changer transitions 21/115 dead transitions. [2022-12-13 11:47:01,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 115 transitions, 753 flow [2022-12-13 11:47:01,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:47:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:47:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-13 11:47:01,162 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.625 [2022-12-13 11:47:01,162 INFO L175 Difference]: Start difference. First operand has 53 places, 59 transitions, 304 flow. Second operand 6 states and 120 transitions. [2022-12-13 11:47:01,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 115 transitions, 753 flow [2022-12-13 11:47:01,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 753 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 11:47:01,165 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 309 flow [2022-12-13 11:47:01,165 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=309, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2022-12-13 11:47:01,165 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -11 predicate places. [2022-12-13 11:47:01,166 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:01,166 INFO L89 Accepts]: Start accepts. Operand has 59 places, 57 transitions, 309 flow [2022-12-13 11:47:01,166 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:01,166 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:01,166 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 57 transitions, 309 flow [2022-12-13 11:47:01,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 57 transitions, 309 flow [2022-12-13 11:47:01,213 INFO L130 PetriNetUnfolder]: 387/974 cut-off events. [2022-12-13 11:47:01,213 INFO L131 PetriNetUnfolder]: For 607/650 co-relation queries the response was YES. [2022-12-13 11:47:01,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 974 events. 387/974 cut-off events. For 607/650 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 7394 event pairs, 64 based on Foata normal form. 7/552 useless extension candidates. Maximal degree in co-relation 2809. Up to 703 conditions per place. [2022-12-13 11:47:01,219 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 57 transitions, 309 flow [2022-12-13 11:47:01,220 INFO L226 LiptonReduction]: Number of co-enabled transitions 770 [2022-12-13 11:47:01,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L749: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_23 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_23, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] and [327] L786-->L789: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-13 11:47:01,504 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [459] $Ultimate##0-->L749: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_23 1)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, ~z~0=v_~z~0_23, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] and [334] L806-->L809: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~y~0_3) InVars {~y~0=v_~y~0_3} OutVars{~y~0=v_~y~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-13 11:47:01,810 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 11:47:01,810 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 644 [2022-12-13 11:47:01,810 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 313 flow [2022-12-13 11:47:01,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:01,811 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:01,811 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:01,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:47:01,811 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:47:01,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2065638039, now seen corresponding path program 1 times [2022-12-13 11:47:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:01,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300916183] [2022-12-13 11:47:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:01,958 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 11:47:01,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:01,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300916183] [2022-12-13 11:47:01,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300916183] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:01,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:01,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:47:01,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732816406] [2022-12-13 11:47:01,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:01,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:47:01,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:01,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:47:01,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:47:01,960 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2022-12-13 11:47:01,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:01,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:01,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2022-12-13 11:47:01,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:02,151 INFO L130 PetriNetUnfolder]: 860/1741 cut-off events. [2022-12-13 11:47:02,151 INFO L131 PetriNetUnfolder]: For 2175/2175 co-relation queries the response was YES. [2022-12-13 11:47:02,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5982 conditions, 1741 events. 860/1741 cut-off events. For 2175/2175 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11032 event pairs, 46 based on Foata normal form. 216/1348 useless extension candidates. Maximal degree in co-relation 5961. Up to 739 conditions per place. [2022-12-13 11:47:02,157 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 24 selfloop transitions, 29 changer transitions 12/74 dead transitions. [2022-12-13 11:47:02,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 74 transitions, 504 flow [2022-12-13 11:47:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:47:02,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:47:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-13 11:47:02,158 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2022-12-13 11:47:02,158 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 313 flow. Second operand 6 states and 113 transitions. [2022-12-13 11:47:02,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 74 transitions, 504 flow [2022-12-13 11:47:02,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 74 transitions, 462 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-13 11:47:02,161 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 333 flow [2022-12-13 11:47:02,161 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-13 11:47:02,162 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -11 predicate places. [2022-12-13 11:47:02,162 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:02,162 INFO L89 Accepts]: Start accepts. Operand has 59 places, 51 transitions, 333 flow [2022-12-13 11:47:02,162 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:02,162 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:02,163 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 333 flow [2022-12-13 11:47:02,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 333 flow [2022-12-13 11:47:02,183 INFO L130 PetriNetUnfolder]: 166/458 cut-off events. [2022-12-13 11:47:02,183 INFO L131 PetriNetUnfolder]: For 508/526 co-relation queries the response was YES. [2022-12-13 11:47:02,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 458 events. 166/458 cut-off events. For 508/526 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2839 event pairs, 1 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 1776. Up to 298 conditions per place. [2022-12-13 11:47:02,185 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 333 flow [2022-12-13 11:47:02,185 INFO L226 LiptonReduction]: Number of co-enabled transitions 494 [2022-12-13 11:47:02,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [424] L765-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= |v_P0Thread1of1ForFork2_#res.offset_13| 0) (= |v_P0Thread1of1ForFork2_#res.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:02,905 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [435] L819-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P2Thread1of1ForFork1_#res.base_9| 0) (= |v_P2Thread1of1ForFork1_#res.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_9|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:03,099 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [434] L819-->P2FINAL: Formula: (and (= |v_P2Thread1of1ForFork1_#res.base_7| 0) (= |v_P2Thread1of1ForFork1_#res.offset_7| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:03,285 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L819-->L822: Formula: (= (+ v_~__unbuffered_cnt~0_6 1) v_~__unbuffered_cnt~0_5) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_6} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_5} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:03,446 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [329] L796-->L799: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:03,602 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [455] L796-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.base_9| 0) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1)) (= |v_P1Thread1of1ForFork0_#res#1.offset_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_9|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_9|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:03,790 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [454] L796-->P1FINAL: Formula: (and (= |v_P1Thread1of1ForFork0_#res#1.offset_7| 0) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= |v_P1Thread1of1ForFork0_#res#1.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P1Thread1of1ForFork0_#res#1.base=|v_P1Thread1of1ForFork0_#res#1.base_7|, P1Thread1of1ForFork0_#res#1.offset=|v_P1Thread1of1ForFork0_#res#1.offset_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res#1.base, P1Thread1of1ForFork0_#res#1.offset] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:03,978 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [321] L765-->L770: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:04,138 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [348] L765-->P0FINAL: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19) (= |v_P0Thread1of1ForFork2_#res.base_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] and [487] L841-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd0~0_127 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_386 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd0~0_120 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_348 256) 0)) .cse4)) (.cse0 (and .cse5 .cse3)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_387 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_347 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_348)) (= v_~main$tmp_guard1~0_92 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EAX~0_146 0) (= v_~__unbuffered_p2_EBX~0_102 0) (= v_~__unbuffered_p1_EAX~0_98 0) (= v_~__unbuffered_p2_EAX~0_98 1))) 1 0)) 0 1)) (= (ite .cse2 v_~x$w_buff0~0_264 (ite .cse1 v_~x$w_buff1~0_237 v_~x~0_308)) v_~x~0_307) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|) (= (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd0~0_126 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_347 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_120) v_~x$r_buff1_thd0~0_119) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_109| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|) (= (ite (= (ite (= v_~__unbuffered_cnt~0_383 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_128) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_73| 0) (= v_~x$r_buff0_thd0~0_126 (ite .cse0 0 v_~x$r_buff0_thd0~0_127)) (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91| (mod v_~main$tmp_guard0~0_128 256)) (= (mod v_~main$tmp_guard1~0_92 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|) (= (ite .cse2 0 v_~x$w_buff0_used~0_387) v_~x$w_buff0_used~0_386)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_127, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_348, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_120, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_387, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_308} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_264, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_126, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_73|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_102, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_101|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_111|, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_347, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_92, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_128, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_119, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_386, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_65|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_98, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_109|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_383, ~x~0=v_~x~0_307, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_91|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~x$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~x~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-13 11:47:04,315 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 11:47:04,316 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2154 [2022-12-13 11:47:04,316 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 375 flow [2022-12-13 11:47:04,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:04,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:04,316 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 11:47:04,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:47:04,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:47:04,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2070990910, now seen corresponding path program 1 times [2022-12-13 11:47:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:04,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661772706] [2022-12-13 11:47:04,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:04,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:04,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 11:47:04,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:04,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661772706] [2022-12-13 11:47:04,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661772706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:04,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:04,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:47:04,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217339944] [2022-12-13 11:47:04,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:04,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:47:04,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:04,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:47:04,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:47:04,676 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 11:47:04,677 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:04,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:04,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 11:47:04,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:04,910 INFO L130 PetriNetUnfolder]: 436/832 cut-off events. [2022-12-13 11:47:04,910 INFO L131 PetriNetUnfolder]: For 2044/2080 co-relation queries the response was YES. [2022-12-13 11:47:04,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 832 events. 436/832 cut-off events. For 2044/2080 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4465 event pairs, 28 based on Foata normal form. 44/639 useless extension candidates. Maximal degree in co-relation 3787. Up to 453 conditions per place. [2022-12-13 11:47:04,915 INFO L137 encePairwiseOnDemand]: 23/37 looper letters, 39 selfloop transitions, 8 changer transitions 29/90 dead transitions. [2022-12-13 11:47:04,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 759 flow [2022-12-13 11:47:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:47:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 11:47:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2022-12-13 11:47:04,917 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5328185328185329 [2022-12-13 11:47:04,917 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 375 flow. Second operand 7 states and 138 transitions. [2022-12-13 11:47:04,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 759 flow [2022-12-13 11:47:04,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 515 flow, removed 27 selfloop flow, removed 8 redundant places. [2022-12-13 11:47:04,926 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 282 flow [2022-12-13 11:47:04,926 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=282, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-13 11:47:04,927 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2022-12-13 11:47:04,927 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:04,927 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 282 flow [2022-12-13 11:47:04,927 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:04,927 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:04,928 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 282 flow [2022-12-13 11:47:04,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 53 transitions, 282 flow [2022-12-13 11:47:04,979 INFO L130 PetriNetUnfolder]: 236/445 cut-off events. [2022-12-13 11:47:04,979 INFO L131 PetriNetUnfolder]: For 442/451 co-relation queries the response was YES. [2022-12-13 11:47:04,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 445 events. 236/445 cut-off events. For 442/451 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2198 event pairs, 1 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 1256. Up to 180 conditions per place. [2022-12-13 11:47:04,982 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 53 transitions, 282 flow [2022-12-13 11:47:04,982 INFO L226 LiptonReduction]: Number of co-enabled transitions 458 [2022-12-13 11:47:05,152 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:05,152 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 225 [2022-12-13 11:47:05,153 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 53 transitions, 288 flow [2022-12-13 11:47:05,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:05,153 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:05,153 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:05,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:47:05,153 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:47:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash -115509889, now seen corresponding path program 1 times [2022-12-13 11:47:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:05,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516180654] [2022-12-13 11:47:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:05,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:05,271 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 11:47:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:05,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516180654] [2022-12-13 11:47:05,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516180654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:05,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:05,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:47:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018719727] [2022-12-13 11:47:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:47:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:05,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:47:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:47:05,273 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2022-12-13 11:47:05,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:05,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:05,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2022-12-13 11:47:05,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:05,462 INFO L130 PetriNetUnfolder]: 494/932 cut-off events. [2022-12-13 11:47:05,462 INFO L131 PetriNetUnfolder]: For 1237/1278 co-relation queries the response was YES. [2022-12-13 11:47:05,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 932 events. 494/932 cut-off events. For 1237/1278 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 5293 event pairs, 28 based on Foata normal form. 52/734 useless extension candidates. Maximal degree in co-relation 3027. Up to 420 conditions per place. [2022-12-13 11:47:05,466 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 41 selfloop transitions, 3 changer transitions 39/91 dead transitions. [2022-12-13 11:47:05,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 91 transitions, 635 flow [2022-12-13 11:47:05,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:47:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:47:05,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-12-13 11:47:05,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45614035087719296 [2022-12-13 11:47:05,467 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 288 flow. Second operand 6 states and 104 transitions. [2022-12-13 11:47:05,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 91 transitions, 635 flow [2022-12-13 11:47:05,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 91 transitions, 615 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-13 11:47:05,474 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 258 flow [2022-12-13 11:47:05,474 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 11:47:05,475 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -15 predicate places. [2022-12-13 11:47:05,475 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:05,475 INFO L89 Accepts]: Start accepts. Operand has 55 places, 47 transitions, 258 flow [2022-12-13 11:47:05,476 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:05,477 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:05,477 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 47 transitions, 258 flow [2022-12-13 11:47:05,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 47 transitions, 258 flow [2022-12-13 11:47:05,496 INFO L130 PetriNetUnfolder]: 120/267 cut-off events. [2022-12-13 11:47:05,497 INFO L131 PetriNetUnfolder]: For 213/222 co-relation queries the response was YES. [2022-12-13 11:47:05,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 267 events. 120/267 cut-off events. For 213/222 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1384 event pairs, 1 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 715. Up to 126 conditions per place. [2022-12-13 11:47:05,498 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 47 transitions, 258 flow [2022-12-13 11:47:05,498 INFO L226 LiptonReduction]: Number of co-enabled transitions 328 [2022-12-13 11:47:06,077 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [504] $Ultimate##0-->L789: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_29| |v_P1Thread1of1ForFork0_~arg#1.offset_29|) (= v_~x$w_buff0_used~0_450 1) (= v_~x$r_buff1_thd2~0_97 v_~x$r_buff0_thd2~0_127) (= v_~x$w_buff0~0_296 1) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|) (= |v_P1Thread1of1ForFork0_~arg#1.base_29| |v_P1Thread1of1ForFork0_#in~arg#1.base_29|) (= v_~y~0_53 v_~__unbuffered_p1_EAX~0_120) (= v_~x$w_buff0_used~0_451 v_~x$w_buff1_used~0_411) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_450 256) 0)) (not (= (mod v_~x$w_buff1_used~0_411 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|) (= v_~x$w_buff0~0_297 v_~x$w_buff1~0_269) (= v_~x$r_buff0_thd2~0_126 1) (= v_~x$r_buff0_thd1~0_203 v_~x$r_buff1_thd1~0_205) (= v_~x$r_buff0_thd0~0_170 v_~x$r_buff1_thd0~0_163) (= v_~x$r_buff0_thd3~0_107 v_~x$r_buff1_thd3~0_103) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31| 0))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_297, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_170, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_203, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~y~0=v_~y~0_53, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_127, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_451} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_296, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_170, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_31|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_203, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_29|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_29|, ~x$w_buff1~0=v_~x$w_buff1~0_269, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_103, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_97, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_411, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_205, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_31|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_163, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_450, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_29|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_120, ~y~0=v_~y~0_53} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0] and [507] $Ultimate##0-->L819: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_108 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_112 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_460 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_418 256) 0)))) (.cse1 (and (not (= 0 (mod v_~x$w_buff0_used~0_461 256))) .cse5))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_112) v_~x$r_buff0_thd3~0_111) (= (ite .cse1 v_~x$w_buff0~0_304 (ite .cse2 v_~x$w_buff1~0_273 v_~x~0_376)) v_~x~0_375) (= (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_417 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_111 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_108) v_~x$r_buff1_thd3~0_107) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_418) v_~x$w_buff1_used~0_417) (= v_P2Thread1of1ForFork1_~arg.offset_17 |v_P2Thread1of1ForFork1_#in~arg.offset_17|) (= (ite .cse1 0 v_~x$w_buff0_used~0_461) v_~x$w_buff0_used~0_460) (= v_~y~0_59 1) (= v_~y~0_59 v_~__unbuffered_p2_EAX~0_128) (= v_P2Thread1of1ForFork1_~arg.base_17 |v_P2Thread1of1ForFork1_#in~arg.base_17|) (= v_~__unbuffered_p2_EBX~0_138 v_~z~0_69)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_304, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_273, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_108, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_418, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_112, ~z~0=v_~z~0_69, ~x~0=v_~x~0_376, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_461} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_304, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_138, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_17, ~x$w_buff1~0=v_~x$w_buff1~0_273, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_107, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_417, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_111, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_460, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_128, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_17|, ~z~0=v_~z~0_69, ~y~0=v_~y~0_59, ~x~0=v_~x~0_375} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0, P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd3~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-13 11:47:06,297 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 11:47:06,298 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 823 [2022-12-13 11:47:06,298 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 272 flow [2022-12-13 11:47:06,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:47:06,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:06,298 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:06,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:47:06,298 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:47:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash 472589732, now seen corresponding path program 1 times [2022-12-13 11:47:06,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:06,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113504045] [2022-12-13 11:47:06,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:06,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:06,673 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 11:47:06,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:06,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113504045] [2022-12-13 11:47:06,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113504045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:06,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:06,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:47:06,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237146092] [2022-12-13 11:47:06,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:06,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:47:06,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:06,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:47:06,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:47:06,675 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2022-12-13 11:47:06,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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 11:47:06,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:06,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2022-12-13 11:47:06,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:06,964 INFO L130 PetriNetUnfolder]: 268/515 cut-off events. [2022-12-13 11:47:06,964 INFO L131 PetriNetUnfolder]: For 866/884 co-relation queries the response was YES. [2022-12-13 11:47:06,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 515 events. 268/515 cut-off events. For 866/884 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 2684 event pairs, 39 based on Foata normal form. 39/386 useless extension candidates. Maximal degree in co-relation 1760. Up to 331 conditions per place. [2022-12-13 11:47:06,966 INFO L137 encePairwiseOnDemand]: 20/34 looper letters, 33 selfloop transitions, 3 changer transitions 26/70 dead transitions. [2022-12-13 11:47:06,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 507 flow [2022-12-13 11:47:06,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:47:06,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 11:47:06,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2022-12-13 11:47:06,967 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4647058823529412 [2022-12-13 11:47:06,967 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 272 flow. Second operand 5 states and 79 transitions. [2022-12-13 11:47:06,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 507 flow [2022-12-13 11:47:06,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 451 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-12-13 11:47:06,970 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 230 flow [2022-12-13 11:47:06,970 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-13 11:47:06,970 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2022-12-13 11:47:06,970 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:06,971 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 230 flow [2022-12-13 11:47:06,971 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:06,971 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:06,971 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 230 flow [2022-12-13 11:47:06,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 230 flow [2022-12-13 11:47:06,989 INFO L130 PetriNetUnfolder]: 100/210 cut-off events. [2022-12-13 11:47:06,989 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-12-13 11:47:06,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 210 events. 100/210 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 1067 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 568. Up to 90 conditions per place. [2022-12-13 11:47:06,990 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 230 flow [2022-12-13 11:47:06,990 INFO L226 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-13 11:47:07,000 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 11:47:07,000 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-13 11:47:07,001 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 230 flow [2022-12-13 11:47:07,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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 11:47:07,001 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:07,001 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:07,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:47:07,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:47:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash 420872056, now seen corresponding path program 1 times [2022-12-13 11:47:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:07,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348991392] [2022-12-13 11:47:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:47:07,297 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 11:47:07,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:47:07,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348991392] [2022-12-13 11:47:07,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348991392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:47:07,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:47:07,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:47:07,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242979919] [2022-12-13 11:47:07,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:47:07,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:47:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:47:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:47:07,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:47:07,300 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-13 11:47:07,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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 11:47:07,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 11:47:07,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-13 11:47:07,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 11:47:07,495 INFO L130 PetriNetUnfolder]: 342/593 cut-off events. [2022-12-13 11:47:07,496 INFO L131 PetriNetUnfolder]: For 779/800 co-relation queries the response was YES. [2022-12-13 11:47:07,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 593 events. 342/593 cut-off events. For 779/800 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 2892 event pairs, 2 based on Foata normal form. 44/399 useless extension candidates. Maximal degree in co-relation 2036. Up to 252 conditions per place. [2022-12-13 11:47:07,498 INFO L137 encePairwiseOnDemand]: 17/32 looper letters, 52 selfloop transitions, 14 changer transitions 15/89 dead transitions. [2022-12-13 11:47:07,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 89 transitions, 620 flow [2022-12-13 11:47:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:47:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 11:47:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2022-12-13 11:47:07,499 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2022-12-13 11:47:07,499 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 230 flow. Second operand 6 states and 97 transitions. [2022-12-13 11:47:07,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 89 transitions, 620 flow [2022-12-13 11:47:07,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 550 flow, removed 32 selfloop flow, removed 5 redundant places. [2022-12-13 11:47:07,503 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 320 flow [2022-12-13 11:47:07,503 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2022-12-13 11:47:07,505 INFO L295 CegarLoopForPetriNet]: 70 programPoint places, -21 predicate places. [2022-12-13 11:47:07,505 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 11:47:07,505 INFO L89 Accepts]: Start accepts. Operand has 49 places, 52 transitions, 320 flow [2022-12-13 11:47:07,506 INFO L95 Accepts]: Finished accepts. [2022-12-13 11:47:07,506 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 11:47:07,506 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 52 transitions, 320 flow [2022-12-13 11:47:07,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 52 transitions, 320 flow [2022-12-13 11:47:07,537 INFO L130 PetriNetUnfolder]: 208/353 cut-off events. [2022-12-13 11:47:07,538 INFO L131 PetriNetUnfolder]: For 305/324 co-relation queries the response was YES. [2022-12-13 11:47:07,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 353 events. 208/353 cut-off events. For 305/324 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 1608 event pairs, 0 based on Foata normal form. 18/133 useless extension candidates. Maximal degree in co-relation 1050. Up to 166 conditions per place. [2022-12-13 11:47:07,539 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 52 transitions, 320 flow [2022-12-13 11:47:07,539 INFO L226 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-13 11:47:08,447 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 11:47:08,447 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 942 [2022-12-13 11:47:08,447 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 52 transitions, 329 flow [2022-12-13 11:47:08,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 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 11:47:08,448 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 11:47:08,448 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:08,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:47:08,448 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 11:47:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:47:08,448 INFO L85 PathProgramCache]: Analyzing trace with hash 2096306504, now seen corresponding path program 1 times [2022-12-13 11:47:08,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:47:08,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407054128] [2022-12-13 11:47:08,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:47:08,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:47:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:47:08,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:47:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:47:08,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:47:08,500 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:47:08,501 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 11:47:08,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 11:47:08,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 11:47:08,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 11:47:08,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 11:47:08,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 11:47:08,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:47:08,502 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:47:08,506 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 11:47:08,506 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:47:08,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:47:08 BasicIcfg [2022-12-13 11:47:08,536 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:47:08,536 INFO L158 Benchmark]: Toolchain (without parser) took 17338.97ms. Allocated memory was 194.0MB in the beginning and 952.1MB in the end (delta: 758.1MB). Free memory was 168.6MB in the beginning and 497.3MB in the end (delta: -328.8MB). Peak memory consumption was 429.0MB. Max. memory is 8.0GB. [2022-12-13 11:47:08,536 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 171.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 11:47:08,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.28ms. Allocated memory is still 194.0MB. Free memory was 168.3MB in the beginning and 142.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 11:47:08,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.16ms. Allocated memory is still 194.0MB. Free memory was 142.1MB in the beginning and 139.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 11:47:08,537 INFO L158 Benchmark]: Boogie Preprocessor took 34.99ms. Allocated memory is still 194.0MB. Free memory was 139.4MB in the beginning and 137.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 11:47:08,537 INFO L158 Benchmark]: RCFGBuilder took 568.78ms. Allocated memory is still 194.0MB. Free memory was 137.9MB in the beginning and 105.9MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-13 11:47:08,537 INFO L158 Benchmark]: TraceAbstraction took 16311.08ms. Allocated memory was 194.0MB in the beginning and 952.1MB in the end (delta: 758.1MB). Free memory was 104.3MB in the beginning and 497.3MB in the end (delta: -393.0MB). Peak memory consumption was 365.1MB. Max. memory is 8.0GB. [2022-12-13 11:47:08,538 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 194.0MB. Free memory is still 171.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 352.28ms. Allocated memory is still 194.0MB. Free memory was 168.3MB in the beginning and 142.1MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 67.16ms. Allocated memory is still 194.0MB. Free memory was 142.1MB in the beginning and 139.4MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.99ms. Allocated memory is still 194.0MB. Free memory was 139.4MB in the beginning and 137.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 568.78ms. Allocated memory is still 194.0MB. Free memory was 137.9MB in the beginning and 105.9MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 16311.08ms. Allocated memory was 194.0MB in the beginning and 952.1MB in the end (delta: 758.1MB). Free memory was 104.3MB in the beginning and 497.3MB in the end (delta: -393.0MB). Peak memory consumption was 365.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 115 PlacesBefore, 70 PlacesAfterwards, 107 TransitionsBefore, 61 TransitionsAfterwards, 1876 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 42 ConcurrentYvCompositions, 4 ChoiceCompositions, 87 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3206, independent: 3081, independent conditional: 3081, independent unconditional: 0, dependent: 125, dependent conditional: 125, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3206, independent: 3081, independent conditional: 0, independent unconditional: 3081, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3206, independent: 3081, independent conditional: 0, independent unconditional: 3081, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3206, independent: 3081, independent conditional: 0, independent unconditional: 3081, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1764, independent: 1717, independent conditional: 0, independent unconditional: 1717, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1764, independent: 1707, independent conditional: 0, independent unconditional: 1707, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3206, independent: 1364, independent conditional: 0, independent unconditional: 1364, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 1764, unknown conditional: 0, unknown unconditional: 1764] , Statistics on independence cache: Total cache size (in pairs): 3540, Positive cache size: 3493, Positive conditional cache size: 0, Positive unconditional cache size: 3493, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 42 PlacesBefore, 42 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 276, independent: 240, independent conditional: 240, 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: 276, independent: 240, independent conditional: 13, independent unconditional: 227, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 276, independent: 240, independent conditional: 13, independent unconditional: 227, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 276, independent: 240, independent conditional: 13, independent unconditional: 227, dependent: 36, dependent conditional: 5, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 230, independent: 205, independent conditional: 12, independent unconditional: 193, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 230, independent: 184, independent conditional: 0, independent unconditional: 184, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 25, dependent conditional: 2, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 89, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 75, dependent conditional: 14, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 276, independent: 35, independent conditional: 1, independent unconditional: 34, dependent: 11, dependent conditional: 3, dependent unconditional: 8, unknown: 230, unknown conditional: 14, unknown unconditional: 216] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 205, Positive conditional cache size: 12, Positive unconditional cache size: 193, Negative cache size: 25, Negative conditional cache size: 2, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 200, independent: 177, independent conditional: 177, 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: 200, independent: 177, independent conditional: 6, independent unconditional: 171, dependent: 23, dependent conditional: 6, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 200, independent: 177, independent conditional: 0, independent unconditional: 177, 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: 200, independent: 177, independent conditional: 0, independent unconditional: 177, 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: 18, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 200, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 222, Positive conditional cache size: 12, Positive unconditional cache size: 210, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 240, independent: 216, independent conditional: 216, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 240, independent: 216, independent conditional: 8, independent unconditional: 208, dependent: 24, dependent conditional: 6, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 240, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 240, independent: 216, independent conditional: 0, independent unconditional: 216, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 237, Positive conditional cache size: 12, Positive unconditional cache size: 225, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 47 PlacesBefore, 47 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 510, independent: 466, independent conditional: 466, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 510, independent: 466, independent conditional: 133, independent unconditional: 333, dependent: 44, dependent conditional: 10, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 510, independent: 466, independent conditional: 102, independent unconditional: 364, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 510, independent: 466, independent conditional: 102, independent unconditional: 364, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 510, independent: 454, independent conditional: 102, independent unconditional: 352, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 254, Positive conditional cache size: 12, Positive unconditional cache size: 242, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 51 PlacesBefore, 51 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 756 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 509, independent: 453, independent conditional: 453, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 509, independent: 453, independent conditional: 169, independent unconditional: 284, dependent: 56, dependent conditional: 10, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 511, independent: 453, independent conditional: 145, independent unconditional: 308, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 511, independent: 453, independent conditional: 145, independent unconditional: 308, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 511, independent: 449, independent conditional: 141, independent unconditional: 308, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 263, Positive conditional cache size: 16, Positive unconditional cache size: 247, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 840 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 210, independent conditional: 210, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 238, independent: 210, independent conditional: 85, independent unconditional: 125, dependent: 28, dependent conditional: 17, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 245, independent: 210, independent conditional: 69, independent unconditional: 141, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 245, independent: 210, independent conditional: 69, independent unconditional: 141, dependent: 35, dependent conditional: 0, dependent unconditional: 35, 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: 245, independent: 210, independent conditional: 69, independent unconditional: 141, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 291, Positive cache size: 263, Positive conditional cache size: 16, Positive unconditional cache size: 247, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 59 PlacesBefore, 58 PlacesAfterwards, 57 TransitionsBefore, 56 TransitionsAfterwards, 770 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 858, independent: 777, independent conditional: 777, independent unconditional: 0, dependent: 81, dependent conditional: 81, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 858, independent: 777, independent conditional: 427, independent unconditional: 350, dependent: 81, dependent conditional: 15, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 882, independent: 777, independent conditional: 369, independent unconditional: 408, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 882, independent: 777, independent conditional: 369, independent unconditional: 408, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 5, independent unconditional: 6, 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: 11, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 882, independent: 766, independent conditional: 364, independent unconditional: 402, dependent: 105, dependent conditional: 0, dependent unconditional: 105, unknown: 11, unknown conditional: 5, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 361, Positive cache size: 333, Positive conditional cache size: 23, Positive unconditional cache size: 310, Negative cache size: 28, Negative conditional cache size: 2, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 97, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 55 PlacesBefore, 52 PlacesAfterwards, 51 TransitionsBefore, 48 TransitionsAfterwards, 494 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 521, independent: 471, independent conditional: 471, independent unconditional: 0, dependent: 50, dependent conditional: 50, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 521, independent: 471, independent conditional: 341, independent unconditional: 130, dependent: 50, dependent conditional: 4, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 521, independent: 471, independent conditional: 315, independent unconditional: 156, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 521, independent: 471, independent conditional: 315, independent unconditional: 156, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 19, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 521, independent: 448, independent conditional: 296, independent unconditional: 152, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 26, unknown conditional: 19, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 398, Positive cache size: 367, Positive conditional cache size: 42, Positive unconditional cache size: 325, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 50 PlacesBefore, 50 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 458 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 39, independent conditional: 19, independent unconditional: 20, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, independent: 39, independent conditional: 12, independent unconditional: 27, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, independent: 39, independent conditional: 12, independent unconditional: 27, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 4, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, independent: 31, independent conditional: 8, independent unconditional: 23, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 421, Positive cache size: 390, Positive conditional cache size: 49, Positive unconditional cache size: 341, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 52 PlacesBefore, 49 PlacesAfterwards, 47 TransitionsBefore, 44 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, independent: 111, independent conditional: 111, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 112, independent: 111, independent conditional: 93, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, independent: 111, independent conditional: 85, independent unconditional: 26, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, independent: 111, independent conditional: 85, independent unconditional: 26, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 4, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, independent: 104, independent conditional: 81, independent unconditional: 23, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 480, Positive cache size: 448, Positive conditional cache size: 54, Positive unconditional cache size: 394, Negative cache size: 32, Negative conditional cache size: 2, Negative unconditional cache size: 30, 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, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 481, Positive cache size: 448, Positive conditional cache size: 54, Positive unconditional cache size: 394, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, 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.9s, 48 PlacesBefore, 48 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 484, Positive cache size: 451, Positive conditional cache size: 54, Positive unconditional cache size: 397, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff1_thd0; [L730] 0 _Bool x$r_buff1_thd1; [L731] 0 _Bool x$r_buff1_thd2; [L732] 0 _Bool x$r_buff1_thd3; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t412; [L837] FCALL, FORK 0 pthread_create(&t412, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t412, ((void *)0), P0, ((void *)0))=-2, t412={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L838] 0 pthread_t t413; [L839] FCALL, FORK 0 pthread_create(&t413, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t413, ((void *)0), P1, ((void *)0))=-1, t412={5:0}, t413={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L840] 0 pthread_t t414; [L841] FCALL, FORK 0 pthread_create(&t414, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t414, ((void *)0), P2, ((void *)0))=0, t412={5:0}, t413={6:0}, t414={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L776] 2 x$w_buff1 = x$w_buff0 [L777] 2 x$w_buff0 = 1 [L778] 2 x$w_buff1_used = x$w_buff0_used [L779] 2 x$w_buff0_used = (_Bool)1 [L780] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L780] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L781] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L782] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L783] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L784] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L785] 2 x$r_buff0_thd2 = (_Bool)1 [L788] 2 __unbuffered_p1_EAX = y [L805] 2 y = 1 [L808] 2 __unbuffered_p2_EAX = y [L811] 2 __unbuffered_p2_EBX = z [L814] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L815] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L816] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L817] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L818] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L748] 1 z = 1 [L751] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 1 x$flush_delayed = weak$$choice2 [L754] 1 x$mem_tmp = x [L755] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L757] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L758] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L759] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L761] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p0_EAX = x [L763] 1 x = x$flush_delayed ? x$mem_tmp : x [L764] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 2 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 2 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 2 !(!cond) [L845] RET 2 assume_abort_if_not(main$tmp_guard0) [L847] 2 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L848] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L849] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L850] 2 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L851] 2 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L854] 2 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L856] CALL 2 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 841]: 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: 837]: 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: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 531 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 531 mSDsluCounter, 29 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 18 mSDtfsCounter, 1201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=375occurred in iteration=8, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:47:08,554 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...