/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:10:04,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:10:04,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:10:04,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:10:04,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:10:04,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:10:04,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:10:04,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:10:04,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:10:04,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:10:04,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:10:04,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:10:04,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:10:04,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:10:04,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:10:04,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:10:04,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:10:04,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:10:04,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:10:04,544 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:10:04,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:10:04,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:10:04,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:10:04,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:10:04,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:10:04,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:10:04,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:10:04,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:10:04,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:10:04,560 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:10:04,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:10:04,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:10:04,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:10:04,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:10:04,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:10:04,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:10:04,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:10:04,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:10:04,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:10:04,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:10:04,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:10:04,572 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:10:04,610 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:10:04,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:10:04,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:10:04,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:10:04,613 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:10:04,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:10:04,613 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:10:04,614 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:10:04,614 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:10:04,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:10:04,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:10:04,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:10:04,615 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:10:04,615 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:10:04,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:10:04,615 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:10:04,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:10:04,616 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:10:04,616 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:10:04,616 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:10:04,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:10:04,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:04,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:10:04,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:10:04,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:10:04,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:10:04,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:10:04,617 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:10:04,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:10:04,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:10:04,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:10:04,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:10:04,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:10:04,943 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:10:04,944 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:10:05,959 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:10:06,230 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:10:06,230 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:10:06,243 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b045004/d969735f763c4df089c8421f70049ec0/FLAG373d52dfb [2022-12-06 04:10:06,258 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b045004/d969735f763c4df089c8421f70049ec0 [2022-12-06 04:10:06,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:10:06,261 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:10:06,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:06,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:10:06,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:10:06,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4670a0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06, skipping insertion in model container [2022-12-06 04:10:06,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:10:06,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:10:06,435 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:10:06,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,607 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,612 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,617 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,618 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,619 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,620 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,621 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:10:06,660 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:10:06,671 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/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-06 04:10:06,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,713 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:10:06,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:10:06,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:10:06,773 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:10:06,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06 WrapperNode [2022-12-06 04:10:06,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:10:06,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:10:06,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:10:06,775 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:10:06,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,818 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-06 04:10:06,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:10:06,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:10:06,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:10:06,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:10:06,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,844 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:10:06,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:10:06,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:10:06,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:10:06,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (1/1) ... [2022-12-06 04:10:06,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:10:06,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:10:06,907 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:10:06,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:10:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:10:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:10:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:10:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:10:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:10:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:10:06,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:10:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:10:06,946 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:10:06,946 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:10:06,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:10:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 04:10:06,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 04:10:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:10:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:10:06,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:10:06,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:10:06,948 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:10:07,067 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:10:07,068 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:10:07,445 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:10:07,570 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:10:07,570 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:10:07,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:07 BoogieIcfgContainer [2022-12-06 04:10:07,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:10:07,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:10:07,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:10:07,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:10:07,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:10:06" (1/3) ... [2022-12-06 04:10:07,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fe1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:07, skipping insertion in model container [2022-12-06 04:10:07,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:10:06" (2/3) ... [2022-12-06 04:10:07,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fe1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:10:07, skipping insertion in model container [2022-12-06 04:10:07,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:10:07" (3/3) ... [2022-12-06 04:10:07,600 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2022-12-06 04:10:07,652 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:10:07,652 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:10:07,652 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:10:07,707 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:10:07,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 04:10:07,806 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 04:10:07,806 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:07,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 04:10:07,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2022-12-06 04:10:07,820 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2022-12-06 04:10:07,822 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:07,852 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 04:10:07,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2022-12-06 04:10:07,890 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-12-06 04:10:07,891 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:07,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2022-12-06 04:10:07,895 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2022-12-06 04:10:07,896 INFO L188 LiptonReduction]: Number of co-enabled transitions 3300 [2022-12-06 04:10:13,211 INFO L203 LiptonReduction]: Total number of compositions: 97 [2022-12-06 04:10:13,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:10:13,239 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;@58e32b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:10:13,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 04:10:13,245 INFO L130 PetriNetUnfolder]: 0/4 cut-off events. [2022-12-06 04:10:13,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:13,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:13,246 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:10:13,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash 554300, now seen corresponding path program 1 times [2022-12-06 04:10:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:13,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160959628] [2022-12-06 04:10:13,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:13,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:13,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160959628] [2022-12-06 04:10:13,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160959628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:13,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:13,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:13,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396780872] [2022-12-06 04:10:13,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:13,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:13,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:13,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:13,604 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 37 [2022-12-06 04:10:13,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:13,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:13,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 37 [2022-12-06 04:10:13,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:14,701 INFO L130 PetriNetUnfolder]: 6050/8310 cut-off events. [2022-12-06 04:10:14,701 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 04:10:14,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16709 conditions, 8310 events. 6050/8310 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 42617 event pairs, 3098 based on Foata normal form. 0/7551 useless extension candidates. Maximal degree in co-relation 16697. Up to 6574 conditions per place. [2022-12-06 04:10:14,743 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 41 selfloop transitions, 2 changer transitions 10/58 dead transitions. [2022-12-06 04:10:14,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 243 flow [2022-12-06 04:10:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:14,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-12-06 04:10:14,754 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6576576576576577 [2022-12-06 04:10:14,755 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 73 transitions. [2022-12-06 04:10:14,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 243 flow [2022-12-06 04:10:14,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:10:14,760 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 70 flow [2022-12-06 04:10:14,762 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-12-06 04:10:14,765 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2022-12-06 04:10:14,765 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:14,766 INFO L89 Accepts]: Start accepts. Operand has 45 places, 29 transitions, 70 flow [2022-12-06 04:10:14,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:14,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:14,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 29 transitions, 70 flow [2022-12-06 04:10:14,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2022-12-06 04:10:14,774 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 04:10:14,774 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:10:14,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:10:14,775 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2022-12-06 04:10:14,775 INFO L188 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-06 04:10:14,874 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:14,876 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 04:10:14,876 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2022-12-06 04:10:14,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:14,877 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:14,877 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:14,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:10:14,877 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:14,878 INFO L85 PathProgramCache]: Analyzing trace with hash 831268696, now seen corresponding path program 1 times [2022-12-06 04:10:14,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:14,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027241435] [2022-12-06 04:10:14,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:14,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:15,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:15,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027241435] [2022-12-06 04:10:15,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027241435] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:15,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:15,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:10:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303542302] [2022-12-06 04:10:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:15,144 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:10:15,144 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:15,144 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:15,144 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:10:15,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:17,887 INFO L130 PetriNetUnfolder]: 20021/27147 cut-off events. [2022-12-06 04:10:17,887 INFO L131 PetriNetUnfolder]: For 1238/1238 co-relation queries the response was YES. [2022-12-06 04:10:17,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56149 conditions, 27147 events. 20021/27147 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 145613 event pairs, 6977 based on Foata normal form. 760/27907 useless extension candidates. Maximal degree in co-relation 56139. Up to 16658 conditions per place. [2022-12-06 04:10:18,039 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions. [2022-12-06 04:10:18,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 230 flow [2022-12-06 04:10:18,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 04:10:18,041 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-06 04:10:18,042 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 54 transitions. [2022-12-06 04:10:18,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 230 flow [2022-12-06 04:10:18,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:18,044 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 136 flow [2022-12-06 04:10:18,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2022-12-06 04:10:18,045 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2022-12-06 04:10:18,045 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:18,045 INFO L89 Accepts]: Start accepts. Operand has 42 places, 37 transitions, 136 flow [2022-12-06 04:10:18,046 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:18,046 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:18,046 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 37 transitions, 136 flow [2022-12-06 04:10:18,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 136 flow [2022-12-06 04:10:18,134 INFO L130 PetriNetUnfolder]: 347/846 cut-off events. [2022-12-06 04:10:18,135 INFO L131 PetriNetUnfolder]: For 114/127 co-relation queries the response was YES. [2022-12-06 04:10:18,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 846 events. 347/846 cut-off events. For 114/127 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5837 event pairs, 149 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 1670. Up to 377 conditions per place. [2022-12-06 04:10:18,144 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 37 transitions, 136 flow [2022-12-06 04:10:18,144 INFO L188 LiptonReduction]: Number of co-enabled transitions 578 [2022-12-06 04:10:18,179 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:18,180 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 135 [2022-12-06 04:10:18,181 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 136 flow [2022-12-06 04:10:18,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:18,186 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:18,186 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:18,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:10:18,186 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:18,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:18,187 INFO L85 PathProgramCache]: Analyzing trace with hash -473243, now seen corresponding path program 1 times [2022-12-06 04:10:18,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:18,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233268918] [2022-12-06 04:10:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:18,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:18,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:18,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233268918] [2022-12-06 04:10:18,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233268918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:18,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:18,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:18,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248110890] [2022-12-06 04:10:18,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:18,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:18,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:18,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:18,387 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:10:18,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 136 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:18,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:18,387 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:10:18,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:20,972 INFO L130 PetriNetUnfolder]: 18540/25160 cut-off events. [2022-12-06 04:10:20,972 INFO L131 PetriNetUnfolder]: For 11590/11590 co-relation queries the response was YES. [2022-12-06 04:10:21,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63998 conditions, 25160 events. 18540/25160 cut-off events. For 11590/11590 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 130361 event pairs, 4807 based on Foata normal form. 275/25435 useless extension candidates. Maximal degree in co-relation 63986. Up to 10821 conditions per place. [2022-12-06 04:10:21,114 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 60 selfloop transitions, 9 changer transitions 0/69 dead transitions. [2022-12-06 04:10:21,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 368 flow [2022-12-06 04:10:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-12-06 04:10:21,117 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5431034482758621 [2022-12-06 04:10:21,117 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 136 flow. Second operand 4 states and 63 transitions. [2022-12-06 04:10:21,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 368 flow [2022-12-06 04:10:21,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:21,194 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 186 flow [2022-12-06 04:10:21,194 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-06 04:10:21,195 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2022-12-06 04:10:21,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:21,196 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 186 flow [2022-12-06 04:10:21,197 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:21,197 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:21,197 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 186 flow [2022-12-06 04:10:21,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 186 flow [2022-12-06 04:10:21,248 INFO L130 PetriNetUnfolder]: 242/610 cut-off events. [2022-12-06 04:10:21,249 INFO L131 PetriNetUnfolder]: For 337/351 co-relation queries the response was YES. [2022-12-06 04:10:21,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1415 conditions, 610 events. 242/610 cut-off events. For 337/351 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3789 event pairs, 82 based on Foata normal form. 0/596 useless extension candidates. Maximal degree in co-relation 1403. Up to 265 conditions per place. [2022-12-06 04:10:21,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 186 flow [2022-12-06 04:10:21,256 INFO L188 LiptonReduction]: Number of co-enabled transitions 654 [2022-12-06 04:10:21,275 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:21,277 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 82 [2022-12-06 04:10:21,277 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 186 flow [2022-12-06 04:10:21,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:21,277 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:21,277 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:21,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:10:21,278 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:21,278 INFO L85 PathProgramCache]: Analyzing trace with hash -23155516, now seen corresponding path program 1 times [2022-12-06 04:10:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:21,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088126808] [2022-12-06 04:10:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:21,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:21,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:21,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:21,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088126808] [2022-12-06 04:10:21,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088126808] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:21,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:21,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997220714] [2022-12-06 04:10:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:21,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:21,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:21,420 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:10:21,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 186 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:21,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:21,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:10:21,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:23,677 INFO L130 PetriNetUnfolder]: 17488/23740 cut-off events. [2022-12-06 04:10:23,678 INFO L131 PetriNetUnfolder]: For 18061/18061 co-relation queries the response was YES. [2022-12-06 04:10:23,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63553 conditions, 23740 events. 17488/23740 cut-off events. For 18061/18061 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 126023 event pairs, 3445 based on Foata normal form. 200/23940 useless extension candidates. Maximal degree in co-relation 63538. Up to 10661 conditions per place. [2022-12-06 04:10:23,811 INFO L137 encePairwiseOnDemand]: 20/29 looper letters, 71 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2022-12-06 04:10:23,811 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 84 transitions, 494 flow [2022-12-06 04:10:23,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:23,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-06 04:10:23,813 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2022-12-06 04:10:23,813 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 186 flow. Second operand 4 states and 71 transitions. [2022-12-06 04:10:23,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 84 transitions, 494 flow [2022-12-06 04:10:23,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:23,847 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 298 flow [2022-12-06 04:10:23,848 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-06 04:10:23,848 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2022-12-06 04:10:23,848 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:23,849 INFO L89 Accepts]: Start accepts. Operand has 51 places, 49 transitions, 298 flow [2022-12-06 04:10:23,849 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:23,849 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:23,850 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 298 flow [2022-12-06 04:10:23,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 298 flow [2022-12-06 04:10:23,897 INFO L130 PetriNetUnfolder]: 188/500 cut-off events. [2022-12-06 04:10:23,898 INFO L131 PetriNetUnfolder]: For 767/794 co-relation queries the response was YES. [2022-12-06 04:10:23,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 500 events. 188/500 cut-off events. For 767/794 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2979 event pairs, 60 based on Foata normal form. 0/488 useless extension candidates. Maximal degree in co-relation 1426. Up to 207 conditions per place. [2022-12-06 04:10:23,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 298 flow [2022-12-06 04:10:23,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 762 [2022-12-06 04:10:23,909 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:23,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 61 [2022-12-06 04:10:23,910 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 298 flow [2022-12-06 04:10:23,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:23,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:23,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:23,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:10:23,910 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:23,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1294698242, now seen corresponding path program 1 times [2022-12-06 04:10:23,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:23,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353361495] [2022-12-06 04:10:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:23,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:24,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:24,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353361495] [2022-12-06 04:10:24,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353361495] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:24,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:24,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:10:24,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882384578] [2022-12-06 04:10:24,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:24,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:10:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:24,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:10:24,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:10:24,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 04:10:24,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:24,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:24,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 04:10:24,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:24,891 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L766-->L773: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_91 256) 0)) .cse0))) (and (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_90 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17) (= (ite .cse2 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= v_~a$r_buff0_thd1~0_26 (ite .cse3 0 v_~a$r_buff0_thd1~0_27)) (= (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_35 v_~a~0_55)) v_~a~0_54) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_91) v_~a$w_buff1_used~0_90)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_91} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_90} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][41], [Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 108#L773true, Black: 166#true, P1Thread1of1ForFork2InUse, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 5#L789true, 123#L887true, 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 103#L826true, Black: 154#true]) [2022-12-06 04:10:24,891 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-06 04:10:24,891 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:24,891 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:24,891 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-06 04:10:25,002 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L829-->L845: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_50 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse4 .cse8)) (.cse12 (= 0 (mod v_~a$w_buff0_used~0_144 256))) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_125 256) 0)))) (let ((.cse10 (or .cse2 .cse12 .cse9)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (ite .cse10 v_~a~0_85 (ite .cse11 v_~a$w_buff0~0_61 v_~a$w_buff1~0_58))) (.cse3 (= (mod v_~a$w_buff0_used~0_143 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse1 v_~a$r_buff0_thd4~0_58 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse3) .cse6) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~a$r_buff1_thd4~0_50 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse7 .cse8) .cse3 (and .cse7 .cse5))) v_~a$r_buff1_thd4~0_50 0)) v_~a$r_buff1_thd4~0_49) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= v_~a~0_84 (ite .cse1 v_~a$mem_tmp~0_14 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_125 (ite (or .cse2 .cse3 .cse9) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse1 v_~a$w_buff0_used~0_144 (ite .cse10 v_~a$w_buff0_used~0_144 (ite .cse11 0 v_~a$w_buff0_used~0_144))) v_~a$w_buff0_used~0_143)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_144, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_49, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_143, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][71], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 86#L845true, 166#true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 62#P2EXITtrue, 53#L766true, P3Thread1of1ForFork1InUse, 159#true, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 5#L789true, P2Thread1of1ForFork3InUse, 123#L887true, Black: 156#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 04:10:25,003 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 04:10:25,003 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:25,003 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:25,003 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:25,004 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([383] L766-->L773: Formula: (let ((.cse0 (not (= (mod v_~a$r_buff1_thd1~0_18 256) 0))) (.cse1 (not (= (mod v_~a$w_buff0_used~0_105 256) 0))) (.cse5 (not (= 0 (mod v_~a$r_buff0_thd1~0_27 256))))) (let ((.cse2 (and .cse5 (not (= (mod v_~a$w_buff0_used~0_106 256) 0)))) (.cse3 (and .cse1 .cse5)) (.cse4 (and (not (= (mod v_~a$w_buff1_used~0_91 256) 0)) .cse0))) (and (= (ite (or (and (not (= (mod v_~a$w_buff1_used~0_90 256) 0)) .cse0) (and .cse1 (not (= (mod v_~a$r_buff0_thd1~0_26 256) 0)))) 0 v_~a$r_buff1_thd1~0_18) v_~a$r_buff1_thd1~0_17) (= (ite .cse2 0 v_~a$w_buff0_used~0_106) v_~a$w_buff0_used~0_105) (= v_~a$r_buff0_thd1~0_26 (ite .cse3 0 v_~a$r_buff0_thd1~0_27)) (= (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_35 v_~a~0_55)) v_~a~0_54) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_91) v_~a$w_buff1_used~0_90)))) InVars {~a~0=v_~a~0_55, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_106, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_91} OutVars{~a~0=v_~a~0_54, ~a$w_buff1~0=v_~a$w_buff1~0_35, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_105, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_90} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd1~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~a$w_buff1_used~0][41], [Black: 161#(= ~__unbuffered_p3_EAX~0 0), 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#true, 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 108#L773true, Black: 166#true, P1Thread1of1ForFork2InUse, 173#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork3InUse, 5#L789true, 51#L829true, 123#L887true, 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 154#true]) [2022-12-06 04:10:25,004 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 04:10:25,004 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:25,004 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:25,004 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:25,251 INFO L130 PetriNetUnfolder]: 7615/11408 cut-off events. [2022-12-06 04:10:25,252 INFO L131 PetriNetUnfolder]: For 10229/11230 co-relation queries the response was YES. [2022-12-06 04:10:25,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29661 conditions, 11408 events. 7615/11408 cut-off events. For 10229/11230 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 70716 event pairs, 1689 based on Foata normal form. 446/11359 useless extension candidates. Maximal degree in co-relation 29642. Up to 9168 conditions per place. [2022-12-06 04:10:25,321 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2022-12-06 04:10:25,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 74 transitions, 508 flow [2022-12-06 04:10:25,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:10:25,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:10:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-06 04:10:25,322 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2022-12-06 04:10:25,322 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 298 flow. Second operand 3 states and 59 transitions. [2022-12-06 04:10:25,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 74 transitions, 508 flow [2022-12-06 04:10:25,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 74 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:25,334 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 327 flow [2022-12-06 04:10:25,335 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2022-12-06 04:10:25,335 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2022-12-06 04:10:25,335 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:25,336 INFO L89 Accepts]: Start accepts. Operand has 53 places, 53 transitions, 327 flow [2022-12-06 04:10:25,337 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:25,337 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:25,337 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 53 transitions, 327 flow [2022-12-06 04:10:25,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 53 transitions, 327 flow [2022-12-06 04:10:25,451 INFO L130 PetriNetUnfolder]: 567/1359 cut-off events. [2022-12-06 04:10:25,451 INFO L131 PetriNetUnfolder]: For 1043/1206 co-relation queries the response was YES. [2022-12-06 04:10:25,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3342 conditions, 1359 events. 567/1359 cut-off events. For 1043/1206 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 10638 event pairs, 235 based on Foata normal form. 2/1258 useless extension candidates. Maximal degree in co-relation 3324. Up to 686 conditions per place. [2022-12-06 04:10:25,467 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 53 transitions, 327 flow [2022-12-06 04:10:25,468 INFO L188 LiptonReduction]: Number of co-enabled transitions 934 [2022-12-06 04:10:25,485 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:25,487 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 152 [2022-12-06 04:10:25,487 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 327 flow [2022-12-06 04:10:25,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:25,487 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:25,487 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:25,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:10:25,487 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash -2126847440, now seen corresponding path program 1 times [2022-12-06 04:10:25,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:25,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842944666] [2022-12-06 04:10:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:25,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:25,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842944666] [2022-12-06 04:10:25,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842944666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:25,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:25,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:25,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915223846] [2022-12-06 04:10:25,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:25,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:25,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:25,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:25,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:25,710 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 04:10:25,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:25,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:25,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 04:10:25,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:26,432 INFO L130 PetriNetUnfolder]: 4120/6536 cut-off events. [2022-12-06 04:10:26,432 INFO L131 PetriNetUnfolder]: For 5861/6145 co-relation queries the response was YES. [2022-12-06 04:10:26,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19713 conditions, 6536 events. 4120/6536 cut-off events. For 5861/6145 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 40331 event pairs, 961 based on Foata normal form. 536/6791 useless extension candidates. Maximal degree in co-relation 19692. Up to 2484 conditions per place. [2022-12-06 04:10:26,472 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 69 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2022-12-06 04:10:26,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 97 transitions, 677 flow [2022-12-06 04:10:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 04:10:26,474 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6982758620689655 [2022-12-06 04:10:26,474 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 327 flow. Second operand 4 states and 81 transitions. [2022-12-06 04:10:26,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 97 transitions, 677 flow [2022-12-06 04:10:26,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 97 transitions, 672 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:10:26,484 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 374 flow [2022-12-06 04:10:26,485 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2022-12-06 04:10:26,485 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2022-12-06 04:10:26,485 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:26,485 INFO L89 Accepts]: Start accepts. Operand has 56 places, 57 transitions, 374 flow [2022-12-06 04:10:26,487 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:26,487 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:26,487 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 57 transitions, 374 flow [2022-12-06 04:10:26,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 374 flow [2022-12-06 04:10:26,577 INFO L130 PetriNetUnfolder]: 364/944 cut-off events. [2022-12-06 04:10:26,577 INFO L131 PetriNetUnfolder]: For 1021/1315 co-relation queries the response was YES. [2022-12-06 04:10:26,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2897 conditions, 944 events. 364/944 cut-off events. For 1021/1315 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6632 event pairs, 88 based on Foata normal form. 41/938 useless extension candidates. Maximal degree in co-relation 2877. Up to 448 conditions per place. [2022-12-06 04:10:26,590 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 57 transitions, 374 flow [2022-12-06 04:10:26,590 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-06 04:10:26,604 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:26,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-06 04:10:26,605 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 374 flow [2022-12-06 04:10:26,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:26,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:26,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:26,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:10:26,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:26,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash -377031090, now seen corresponding path program 1 times [2022-12-06 04:10:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:26,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649370677] [2022-12-06 04:10:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:26,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:26,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649370677] [2022-12-06 04:10:26,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649370677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:26,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:26,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:26,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998973177] [2022-12-06 04:10:26,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:26,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:26,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:26,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:26,881 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:10:26,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 374 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:26,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:26,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:10:26,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:28,024 INFO L130 PetriNetUnfolder]: 8433/12515 cut-off events. [2022-12-06 04:10:28,024 INFO L131 PetriNetUnfolder]: For 27346/27346 co-relation queries the response was YES. [2022-12-06 04:10:28,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45137 conditions, 12515 events. 8433/12515 cut-off events. For 27346/27346 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 71031 event pairs, 661 based on Foata normal form. 66/12581 useless extension candidates. Maximal degree in co-relation 45114. Up to 4200 conditions per place. [2022-12-06 04:10:28,072 INFO L137 encePairwiseOnDemand]: 18/29 looper letters, 109 selfloop transitions, 39 changer transitions 24/172 dead transitions. [2022-12-06 04:10:28,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 172 transitions, 1390 flow [2022-12-06 04:10:28,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2022-12-06 04:10:28,073 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6264367816091954 [2022-12-06 04:10:28,073 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 374 flow. Second operand 6 states and 109 transitions. [2022-12-06 04:10:28,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 172 transitions, 1390 flow [2022-12-06 04:10:28,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 172 transitions, 1316 flow, removed 18 selfloop flow, removed 2 redundant places. [2022-12-06 04:10:28,110 INFO L231 Difference]: Finished difference. Result has 61 places, 76 transitions, 636 flow [2022-12-06 04:10:28,110 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=636, PETRI_PLACES=61, PETRI_TRANSITIONS=76} [2022-12-06 04:10:28,110 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2022-12-06 04:10:28,111 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:28,111 INFO L89 Accepts]: Start accepts. Operand has 61 places, 76 transitions, 636 flow [2022-12-06 04:10:28,112 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:28,112 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:28,112 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 76 transitions, 636 flow [2022-12-06 04:10:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 76 transitions, 636 flow [2022-12-06 04:10:28,236 INFO L130 PetriNetUnfolder]: 553/1422 cut-off events. [2022-12-06 04:10:28,237 INFO L131 PetriNetUnfolder]: For 2312/2567 co-relation queries the response was YES. [2022-12-06 04:10:28,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4335 conditions, 1422 events. 553/1422 cut-off events. For 2312/2567 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 11090 event pairs, 111 based on Foata normal form. 82/1440 useless extension candidates. Maximal degree in co-relation 4313. Up to 624 conditions per place. [2022-12-06 04:10:28,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 76 transitions, 636 flow [2022-12-06 04:10:28,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 1296 [2022-12-06 04:10:28,269 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:28,269 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 04:10:28,270 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 76 transitions, 636 flow [2022-12-06 04:10:28,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:28,270 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:28,270 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:28,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:10:28,270 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:28,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2103249206, now seen corresponding path program 1 times [2022-12-06 04:10:28,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:28,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746026377] [2022-12-06 04:10:28,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:28,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:28,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:28,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746026377] [2022-12-06 04:10:28,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746026377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:28,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:28,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:10:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372165033] [2022-12-06 04:10:28,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:28,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:10:28,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:28,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:10:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:10:28,533 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 04:10:28,534 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 76 transitions, 636 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:28,534 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:28,534 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 04:10:28,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:29,053 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([405] L829-->L845: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd4~0_50 256) 0)) (.cse4 (= (mod v_~a$r_buff0_thd4~0_58 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse4 .cse8)) (.cse12 (= 0 (mod v_~a$w_buff0_used~0_144 256))) (.cse9 (and .cse4 (= (mod v_~a$w_buff1_used~0_125 256) 0)))) (let ((.cse10 (or .cse2 .cse12 .cse9)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse5 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse0 (ite .cse10 v_~a~0_85 (ite .cse11 v_~a$w_buff0~0_61 v_~a$w_buff1~0_58))) (.cse3 (= (mod v_~a$w_buff0_used~0_143 256) 0)) (.cse1 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~a$w_buff0~0_61 v_~a$w_buff0~0_60) (= v_~weak$$choice0~0_7 |v_P3Thread1of1ForFork1_#t~nondet3_1|) (= .cse0 v_~__unbuffered_p3_EBX~0_10) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$flush_delayed~0_21 0) (= v_~a$r_buff0_thd4~0_57 (ite .cse1 v_~a$r_buff0_thd4~0_58 (ite (or .cse2 .cse3 (and .cse4 .cse5)) v_~a$r_buff0_thd4~0_58 (ite (and (not .cse3) .cse6) 0 v_~a$r_buff0_thd4~0_58)))) (= v_~weak$$choice2~0_30 |v_P3Thread1of1ForFork1_#t~nondet4_1|) (= (ite .cse1 v_~a$r_buff1_thd4~0_50 (ite (let ((.cse7 (= (mod v_~a$r_buff0_thd4~0_57 256) 0))) (or (and .cse7 .cse8) .cse3 (and .cse7 .cse5))) v_~a$r_buff1_thd4~0_50 0)) v_~a$r_buff1_thd4~0_49) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= v_~a~0_84 (ite .cse1 v_~a$mem_tmp~0_14 .cse0)) (= (ite .cse1 v_~a$w_buff1_used~0_125 (ite (or .cse2 .cse3 .cse9) v_~a$w_buff1_used~0_125 0)) v_~a$w_buff1_used~0_124) (= (ite .cse1 v_~a$w_buff0_used~0_144 (ite .cse10 v_~a$w_buff0_used~0_144 (ite .cse11 0 v_~a$w_buff0_used~0_144))) v_~a$w_buff0_used~0_143)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_61, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_50, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_144, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_58, P3Thread1of1ForFork1_#t~nondet3=|v_P3Thread1of1ForFork1_#t~nondet3_1|, P3Thread1of1ForFork1_#t~nondet4=|v_P3Thread1of1ForFork1_#t~nondet4_1|} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_49, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_143, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_57, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_7, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_21, ~a$w_buff0~0=v_~a$w_buff0~0_60, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork1_#t~nondet3, P3Thread1of1ForFork1_#t~nondet4][110], [Black: 184#(= ~y~0 1), Black: 161#(= ~__unbuffered_p3_EAX~0 0), Black: 162#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 32#L876-3true, 86#L845true, Black: 169#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 62#P2EXITtrue, P3Thread1of1ForFork1InUse, 166#true, 191#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), P1Thread1of1ForFork2InUse, 159#true, Black: 168#(= ~__unbuffered_p1_EAX~0 0), P0Thread1of1ForFork0InUse, 119#P0EXITtrue, Black: 175#(= ~__unbuffered_cnt~0 0), P2Thread1of1ForFork3InUse, 5#L789true, Black: 180#(<= ~__unbuffered_cnt~0 1), 199#(<= ~__unbuffered_cnt~0 2), Black: 156#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))]) [2022-12-06 04:10:29,054 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-06 04:10:29,054 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:29,054 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:29,054 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-06 04:10:29,163 INFO L130 PetriNetUnfolder]: 4228/6704 cut-off events. [2022-12-06 04:10:29,163 INFO L131 PetriNetUnfolder]: For 11824/12057 co-relation queries the response was YES. [2022-12-06 04:10:29,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21644 conditions, 6704 events. 4228/6704 cut-off events. For 11824/12057 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 42247 event pairs, 994 based on Foata normal form. 330/6715 useless extension candidates. Maximal degree in co-relation 21619. Up to 2568 conditions per place. [2022-12-06 04:10:29,213 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 100 selfloop transitions, 13 changer transitions 2/146 dead transitions. [2022-12-06 04:10:29,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 146 transitions, 1288 flow [2022-12-06 04:10:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:10:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:10:29,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2022-12-06 04:10:29,215 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.696551724137931 [2022-12-06 04:10:29,216 INFO L175 Difference]: Start difference. First operand has 61 places, 76 transitions, 636 flow. Second operand 5 states and 101 transitions. [2022-12-06 04:10:29,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 146 transitions, 1288 flow [2022-12-06 04:10:29,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 146 transitions, 1288 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:10:29,235 INFO L231 Difference]: Finished difference. Result has 66 places, 80 transitions, 704 flow [2022-12-06 04:10:29,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=704, PETRI_PLACES=66, PETRI_TRANSITIONS=80} [2022-12-06 04:10:29,239 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2022-12-06 04:10:29,240 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:29,240 INFO L89 Accepts]: Start accepts. Operand has 66 places, 80 transitions, 704 flow [2022-12-06 04:10:29,245 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:29,245 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:29,245 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 80 transitions, 704 flow [2022-12-06 04:10:29,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 80 transitions, 704 flow [2022-12-06 04:10:29,325 INFO L130 PetriNetUnfolder]: 424/1024 cut-off events. [2022-12-06 04:10:29,325 INFO L131 PetriNetUnfolder]: For 2771/3035 co-relation queries the response was YES. [2022-12-06 04:10:29,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3831 conditions, 1024 events. 424/1024 cut-off events. For 2771/3035 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7016 event pairs, 54 based on Foata normal form. 77/1059 useless extension candidates. Maximal degree in co-relation 3806. Up to 371 conditions per place. [2022-12-06 04:10:29,338 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 80 transitions, 704 flow [2022-12-06 04:10:29,338 INFO L188 LiptonReduction]: Number of co-enabled transitions 1228 [2022-12-06 04:10:29,410 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:29,411 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 171 [2022-12-06 04:10:29,412 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 704 flow [2022-12-06 04:10:29,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:29,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:29,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:29,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:10:29,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:29,413 INFO L85 PathProgramCache]: Analyzing trace with hash 475068946, now seen corresponding path program 1 times [2022-12-06 04:10:29,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:29,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698042702] [2022-12-06 04:10:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:29,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:29,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:29,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:29,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698042702] [2022-12-06 04:10:29,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698042702] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:29,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:29,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361324297] [2022-12-06 04:10:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:29,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:29,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:29,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:29,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:29,642 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:10:29,643 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 704 flow. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:29,643 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:29,643 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:10:29,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:30,847 INFO L130 PetriNetUnfolder]: 8556/12875 cut-off events. [2022-12-06 04:10:30,847 INFO L131 PetriNetUnfolder]: For 41825/41825 co-relation queries the response was YES. [2022-12-06 04:10:30,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50659 conditions, 12875 events. 8556/12875 cut-off events. For 41825/41825 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 76461 event pairs, 1791 based on Foata normal form. 13/12888 useless extension candidates. Maximal degree in co-relation 50631. Up to 5785 conditions per place. [2022-12-06 04:10:30,893 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 99 selfloop transitions, 26 changer transitions 38/163 dead transitions. [2022-12-06 04:10:30,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 163 transitions, 1624 flow [2022-12-06 04:10:30,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-06 04:10:30,894 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2022-12-06 04:10:30,895 INFO L175 Difference]: Start difference. First operand has 66 places, 80 transitions, 704 flow. Second operand 4 states and 78 transitions. [2022-12-06 04:10:30,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 163 transitions, 1624 flow [2022-12-06 04:10:31,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 163 transitions, 1526 flow, removed 24 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:31,132 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 699 flow [2022-12-06 04:10:31,132 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=699, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2022-12-06 04:10:31,133 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2022-12-06 04:10:31,133 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:31,133 INFO L89 Accepts]: Start accepts. Operand has 69 places, 75 transitions, 699 flow [2022-12-06 04:10:31,135 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:31,135 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:31,135 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 75 transitions, 699 flow [2022-12-06 04:10:31,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 75 transitions, 699 flow [2022-12-06 04:10:31,199 INFO L130 PetriNetUnfolder]: 417/1120 cut-off events. [2022-12-06 04:10:31,199 INFO L131 PetriNetUnfolder]: For 2776/2963 co-relation queries the response was YES. [2022-12-06 04:10:31,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3811 conditions, 1120 events. 417/1120 cut-off events. For 2776/2963 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8447 event pairs, 46 based on Foata normal form. 84/1157 useless extension candidates. Maximal degree in co-relation 3783. Up to 340 conditions per place. [2022-12-06 04:10:31,207 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 75 transitions, 699 flow [2022-12-06 04:10:31,207 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-06 04:10:31,217 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:31,217 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 04:10:31,218 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 699 flow [2022-12-06 04:10:31,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:31,218 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:31,218 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:31,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:10:31,218 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 503937636, now seen corresponding path program 1 times [2022-12-06 04:10:31,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:31,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823663701] [2022-12-06 04:10:31,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:31,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:32,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:32,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823663701] [2022-12-06 04:10:32,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823663701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:32,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:32,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:32,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742536898] [2022-12-06 04:10:32,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:32,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 04:10:32,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:32,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 04:10:32,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:10:32,190 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 04:10:32,190 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 699 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:32,190 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:32,190 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 04:10:32,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:33,518 INFO L130 PetriNetUnfolder]: 6536/11120 cut-off events. [2022-12-06 04:10:33,518 INFO L131 PetriNetUnfolder]: For 26086/26727 co-relation queries the response was YES. [2022-12-06 04:10:33,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38138 conditions, 11120 events. 6536/11120 cut-off events. For 26086/26727 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 82737 event pairs, 1219 based on Foata normal form. 88/10956 useless extension candidates. Maximal degree in co-relation 38107. Up to 5305 conditions per place. [2022-12-06 04:10:33,555 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 130 selfloop transitions, 9 changer transitions 27/189 dead transitions. [2022-12-06 04:10:33,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 189 transitions, 1830 flow [2022-12-06 04:10:33,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2022-12-06 04:10:33,556 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6494252873563219 [2022-12-06 04:10:33,556 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 699 flow. Second operand 6 states and 113 transitions. [2022-12-06 04:10:33,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 189 transitions, 1830 flow [2022-12-06 04:10:33,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 189 transitions, 1816 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-12-06 04:10:33,816 INFO L231 Difference]: Finished difference. Result has 78 places, 83 transitions, 765 flow [2022-12-06 04:10:33,817 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=765, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2022-12-06 04:10:33,817 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 29 predicate places. [2022-12-06 04:10:33,817 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:33,817 INFO L89 Accepts]: Start accepts. Operand has 78 places, 83 transitions, 765 flow [2022-12-06 04:10:33,818 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:33,819 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:33,819 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 83 transitions, 765 flow [2022-12-06 04:10:33,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 83 transitions, 765 flow [2022-12-06 04:10:34,137 INFO L130 PetriNetUnfolder]: 1403/3609 cut-off events. [2022-12-06 04:10:34,137 INFO L131 PetriNetUnfolder]: For 6212/6847 co-relation queries the response was YES. [2022-12-06 04:10:34,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11240 conditions, 3609 events. 1403/3609 cut-off events. For 6212/6847 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 33967 event pairs, 178 based on Foata normal form. 316/3683 useless extension candidates. Maximal degree in co-relation 11206. Up to 1294 conditions per place. [2022-12-06 04:10:34,176 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 83 transitions, 765 flow [2022-12-06 04:10:34,176 INFO L188 LiptonReduction]: Number of co-enabled transitions 1342 [2022-12-06 04:10:34,180 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:10:34,181 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 364 [2022-12-06 04:10:34,181 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 765 flow [2022-12-06 04:10:34,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:34,181 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:34,181 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:34,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:10:34,182 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:34,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash -104268896, now seen corresponding path program 2 times [2022-12-06 04:10:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:34,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643927824] [2022-12-06 04:10:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:34,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:34,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:34,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643927824] [2022-12-06 04:10:34,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643927824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:34,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:34,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:10:34,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945262965] [2022-12-06 04:10:34,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:34,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:10:34,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:10:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:10:34,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2022-12-06 04:10:34,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 765 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:34,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:34,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2022-12-06 04:10:34,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:35,538 INFO L130 PetriNetUnfolder]: 6263/10470 cut-off events. [2022-12-06 04:10:35,539 INFO L131 PetriNetUnfolder]: For 30711/31470 co-relation queries the response was YES. [2022-12-06 04:10:35,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41787 conditions, 10470 events. 6263/10470 cut-off events. For 30711/31470 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 77401 event pairs, 870 based on Foata normal form. 260/10462 useless extension candidates. Maximal degree in co-relation 41750. Up to 4141 conditions per place. [2022-12-06 04:10:35,588 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 66 selfloop transitions, 17 changer transitions 62/155 dead transitions. [2022-12-06 04:10:35,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 155 transitions, 1613 flow [2022-12-06 04:10:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:10:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:10:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2022-12-06 04:10:35,589 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2022-12-06 04:10:35,589 INFO L175 Difference]: Start difference. First operand has 78 places, 83 transitions, 765 flow. Second operand 6 states and 106 transitions. [2022-12-06 04:10:35,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 155 transitions, 1613 flow [2022-12-06 04:10:36,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 155 transitions, 1591 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-06 04:10:36,060 INFO L231 Difference]: Finished difference. Result has 81 places, 55 transitions, 460 flow [2022-12-06 04:10:36,060 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=81, PETRI_TRANSITIONS=55} [2022-12-06 04:10:36,061 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 32 predicate places. [2022-12-06 04:10:36,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:36,061 INFO L89 Accepts]: Start accepts. Operand has 81 places, 55 transitions, 460 flow [2022-12-06 04:10:36,062 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:36,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:36,062 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 55 transitions, 460 flow [2022-12-06 04:10:36,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 55 transitions, 460 flow [2022-12-06 04:10:36,104 INFO L130 PetriNetUnfolder]: 235/581 cut-off events. [2022-12-06 04:10:36,105 INFO L131 PetriNetUnfolder]: For 1103/1233 co-relation queries the response was YES. [2022-12-06 04:10:36,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 581 events. 235/581 cut-off events. For 1103/1233 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3522 event pairs, 30 based on Foata normal form. 1/521 useless extension candidates. Maximal degree in co-relation 2129. Up to 212 conditions per place. [2022-12-06 04:10:36,109 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 55 transitions, 460 flow [2022-12-06 04:10:36,109 INFO L188 LiptonReduction]: Number of co-enabled transitions 558 [2022-12-06 04:10:36,768 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:10:36,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 708 [2022-12-06 04:10:36,769 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 465 flow [2022-12-06 04:10:36,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:36,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:36,769 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:36,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:10:36,770 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:36,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash -502379983, now seen corresponding path program 1 times [2022-12-06 04:10:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:36,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349490261] [2022-12-06 04:10:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:10:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:10:36,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:10:36,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349490261] [2022-12-06 04:10:36,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349490261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:10:36,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:10:36,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:10:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780896066] [2022-12-06 04:10:36,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:10:36,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:10:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:10:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:10:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:10:36,968 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 04:10:36,968 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 465 flow. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:36,968 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:10:36,968 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 04:10:36,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:10:37,496 INFO L130 PetriNetUnfolder]: 1874/3092 cut-off events. [2022-12-06 04:10:37,496 INFO L131 PetriNetUnfolder]: For 16157/16157 co-relation queries the response was YES. [2022-12-06 04:10:37,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14629 conditions, 3092 events. 1874/3092 cut-off events. For 16157/16157 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16828 event pairs, 459 based on Foata normal form. 2/3094 useless extension candidates. Maximal degree in co-relation 14592. Up to 1760 conditions per place. [2022-12-06 04:10:37,514 INFO L137 encePairwiseOnDemand]: 21/31 looper letters, 56 selfloop transitions, 4 changer transitions 29/89 dead transitions. [2022-12-06 04:10:37,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 89 transitions, 885 flow [2022-12-06 04:10:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:10:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:10:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-06 04:10:37,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2022-12-06 04:10:37,516 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 465 flow. Second operand 4 states and 56 transitions. [2022-12-06 04:10:37,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 89 transitions, 885 flow [2022-12-06 04:10:37,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 89 transitions, 733 flow, removed 29 selfloop flow, removed 11 redundant places. [2022-12-06 04:10:37,554 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 253 flow [2022-12-06 04:10:37,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2022-12-06 04:10:37,555 INFO L294 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2022-12-06 04:10:37,555 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:10:37,555 INFO L89 Accepts]: Start accepts. Operand has 69 places, 40 transitions, 253 flow [2022-12-06 04:10:37,556 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:10:37,556 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:10:37,556 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 40 transitions, 253 flow [2022-12-06 04:10:37,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 40 transitions, 253 flow [2022-12-06 04:10:37,579 INFO L130 PetriNetUnfolder]: 91/223 cut-off events. [2022-12-06 04:10:37,579 INFO L131 PetriNetUnfolder]: For 562/628 co-relation queries the response was YES. [2022-12-06 04:10:37,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 223 events. 91/223 cut-off events. For 562/628 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 952 event pairs, 11 based on Foata normal form. 7/203 useless extension candidates. Maximal degree in co-relation 667. Up to 79 conditions per place. [2022-12-06 04:10:37,582 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 40 transitions, 253 flow [2022-12-06 04:10:37,582 INFO L188 LiptonReduction]: Number of co-enabled transitions 342 [2022-12-06 04:10:38,278 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:10:38,279 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 724 [2022-12-06 04:10:38,279 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 36 transitions, 237 flow [2022-12-06 04:10:38,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:10:38,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:10:38,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:38,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:10:38,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 04:10:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:10:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash -345714816, now seen corresponding path program 1 times [2022-12-06 04:10:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:10:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126060901] [2022-12-06 04:10:38,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:10:38,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:10:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:38,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:10:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:10:38,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:10:38,483 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:10:38,484 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 04:10:38,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 04:10:38,486 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 04:10:38,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 04:10:38,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 04:10:38,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 04:10:38,487 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 04:10:38,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:10:38,488 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:10:38,492 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:10:38,492 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:10:38,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:10:38 BasicIcfg [2022-12-06 04:10:38,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:10:38,581 INFO L158 Benchmark]: Toolchain (without parser) took 32319.87ms. Allocated memory was 180.4MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 155.0MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 738.8MB. Max. memory is 8.0GB. [2022-12-06 04:10:38,581 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:10:38,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.13ms. Allocated memory is still 180.4MB. Free memory was 154.8MB in the beginning and 126.0MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 04:10:38,581 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.32ms. Allocated memory is still 180.4MB. Free memory was 126.0MB in the beginning and 123.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:38,582 INFO L158 Benchmark]: Boogie Preprocessor took 33.35ms. Allocated memory is still 180.4MB. Free memory was 123.4MB in the beginning and 121.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:10:38,582 INFO L158 Benchmark]: RCFGBuilder took 719.71ms. Allocated memory is still 180.4MB. Free memory was 121.3MB in the beginning and 84.1MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 04:10:38,582 INFO L158 Benchmark]: TraceAbstraction took 30986.05ms. Allocated memory was 239.1MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 215.0MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 738.7MB. Max. memory is 8.0GB. [2022-12-06 04:10:38,591 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.12ms. Allocated memory is still 180.4MB. Free memory is still 157.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 512.13ms. Allocated memory is still 180.4MB. Free memory was 154.8MB in the beginning and 126.0MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.32ms. Allocated memory is still 180.4MB. Free memory was 126.0MB in the beginning and 123.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.35ms. Allocated memory is still 180.4MB. Free memory was 123.4MB in the beginning and 121.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 719.71ms. Allocated memory is still 180.4MB. Free memory was 121.3MB in the beginning and 84.1MB in the end (delta: 37.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 30986.05ms. Allocated memory was 239.1MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 215.0MB in the beginning and 3.0GB in the end (delta: -2.8GB). Peak memory consumption was 738.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 139 PlacesBefore, 49 PlacesAfterwards, 128 TransitionsBefore, 37 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 43 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 97 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 2263, independent unconditional: 0, dependent: 77, dependent conditional: 77, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2340, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1809, independent: 1763, independent conditional: 0, independent unconditional: 1763, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1809, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 264, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 240, dependent conditional: 0, dependent unconditional: 240, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2340, independent: 500, independent conditional: 0, independent unconditional: 500, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 1809, unknown conditional: 0, unknown unconditional: 1809] , Statistics on independence cache: Total cache size (in pairs): 2677, Positive cache size: 2631, Positive conditional cache size: 0, Positive unconditional cache size: 2631, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46, 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, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192, independent: 160, independent conditional: 160, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 192, independent: 160, independent conditional: 27, independent unconditional: 133, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192, independent: 160, independent conditional: 27, independent unconditional: 133, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 160, independent conditional: 27, independent unconditional: 133, dependent: 32, dependent conditional: 11, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 175, independent: 148, independent conditional: 24, independent unconditional: 124, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 175, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 92, dependent conditional: 53, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 192, independent: 12, independent conditional: 3, independent unconditional: 9, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 175, unknown conditional: 34, unknown unconditional: 141] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 148, Positive conditional cache size: 24, Positive unconditional cache size: 124, Negative cache size: 27, Negative conditional cache size: 10, Negative unconditional cache size: 17, 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, 37 TransitionsBefore, 37 TransitionsAfterwards, 578 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 138, independent conditional: 138, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 153, independent: 138, independent conditional: 26, independent unconditional: 112, dependent: 15, dependent conditional: 2, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 138, independent conditional: 8, independent unconditional: 130, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 138, independent conditional: 8, independent unconditional: 130, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 120, independent conditional: 7, independent unconditional: 113, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 24, unknown conditional: 1, unknown unconditional: 23] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 166, Positive conditional cache size: 25, Positive unconditional cache size: 141, Negative cache size: 33, Negative conditional cache size: 10, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 159, independent conditional: 159, 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: 182, independent: 159, independent conditional: 21, independent unconditional: 138, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 182, independent: 159, independent conditional: 7, independent unconditional: 152, 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: 182, independent: 159, independent conditional: 7, independent unconditional: 152, 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: 9, independent: 7, independent conditional: 0, independent unconditional: 7, 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: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, independent: 152, independent conditional: 7, independent unconditional: 145, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 173, Positive conditional cache size: 25, Positive unconditional cache size: 148, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 762 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 203, independent: 173, independent conditional: 173, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 203, independent: 173, independent conditional: 27, independent unconditional: 146, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 203, independent: 173, independent conditional: 1, independent unconditional: 172, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 203, independent: 173, independent conditional: 1, independent unconditional: 172, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, independent: 171, independent conditional: 1, independent unconditional: 170, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 175, Positive conditional cache size: 25, Positive unconditional cache size: 150, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 53 PlacesBefore, 53 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 934 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 137, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 137, independent: 110, independent conditional: 5, independent unconditional: 105, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 137, independent: 110, independent conditional: 5, independent unconditional: 105, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 137, independent: 110, independent conditional: 5, independent unconditional: 105, dependent: 27, dependent conditional: 0, dependent unconditional: 27, 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: 137, independent: 110, independent conditional: 5, independent unconditional: 105, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 175, Positive conditional cache size: 25, Positive unconditional cache size: 150, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 1070 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, independent: 115, independent conditional: 115, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 147, independent: 115, independent conditional: 5, independent unconditional: 110, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, independent: 115, independent conditional: 5, independent unconditional: 110, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, independent: 115, independent conditional: 5, independent unconditional: 110, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 147, independent: 115, independent conditional: 5, independent unconditional: 110, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 175, Positive conditional cache size: 25, Positive unconditional cache size: 150, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, independent: 211, independent conditional: 211, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 248, independent: 211, independent conditional: 99, independent unconditional: 112, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 248, independent: 211, independent conditional: 32, independent unconditional: 179, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 248, independent: 211, independent conditional: 32, independent unconditional: 179, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 248, independent: 206, independent conditional: 32, independent unconditional: 174, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 180, Positive conditional cache size: 25, Positive unconditional cache size: 155, Negative cache size: 35, Negative conditional cache size: 10, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 66 PlacesBefore, 66 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 248, independent: 204, independent conditional: 204, 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: 248, independent: 204, independent conditional: 44, independent unconditional: 160, dependent: 44, dependent conditional: 18, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 284, independent: 204, independent conditional: 8, independent unconditional: 196, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 284, independent: 204, independent conditional: 8, independent unconditional: 196, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 284, independent: 201, independent conditional: 8, independent unconditional: 193, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 183, Positive conditional cache size: 25, Positive unconditional cache size: 158, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 90, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 69 PlacesBefore, 69 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1070 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 163, independent: 127, independent conditional: 127, 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: 163, independent: 127, independent conditional: 61, independent unconditional: 66, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 127, independent conditional: 49, independent unconditional: 78, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 127, independent conditional: 49, independent unconditional: 78, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, independent: 123, independent conditional: 46, independent unconditional: 77, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 227, Positive cache size: 187, Positive conditional cache size: 28, Positive unconditional cache size: 159, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, 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, 78 PlacesBefore, 78 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 232, Positive cache size: 192, Positive conditional cache size: 30, Positive unconditional cache size: 162, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 79 PlacesBefore, 76 PlacesAfterwards, 55 TransitionsBefore, 52 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 86, 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: 86, independent: 86, independent conditional: 56, independent unconditional: 30, 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: 86, independent: 86, independent conditional: 54, independent unconditional: 32, 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: 86, independent: 86, independent conditional: 54, independent unconditional: 32, 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: 18, independent: 18, independent conditional: 8, independent unconditional: 10, 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: 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] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, independent: 68, independent conditional: 46, independent unconditional: 22, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 18, unknown conditional: 8, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 335, Positive cache size: 295, Positive conditional cache size: 46, Positive unconditional cache size: 249, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 67 PlacesBefore, 63 PlacesAfterwards, 40 TransitionsBefore, 36 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 42, 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: 42, independent: 42, independent conditional: 39, independent unconditional: 3, 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: 42, independent: 42, independent conditional: 23, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 42, independent conditional: 23, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, independent: 22, independent conditional: 10, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 42, independent: 20, independent conditional: 13, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 10, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 394, Positive cache size: 354, Positive conditional cache size: 62, Positive unconditional cache size: 292, Negative cache size: 40, Negative conditional cache size: 10, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=-3, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-2, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=-1, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 [L785] 2 __unbuffered_p1_EAX = x [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 [L828] 4 __unbuffered_p3_EAX = z [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 872]: 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: 870]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 472 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 472 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1184 IncrementalHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 41 mSDtfsCounter, 1184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=765occurred in iteration=10, InterpolantAutomatonStates: 52, 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.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 1397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:10:38,614 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...