/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 20:55:18,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 20:55:18,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 20:55:18,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 20:55:18,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 20:55:18,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 20:55:18,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 20:55:18,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 20:55:18,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 20:55:18,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 20:55:18,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 20:55:18,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 20:55:18,806 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 20:55:18,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 20:55:18,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 20:55:18,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 20:55:18,811 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 20:55:18,812 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 20:55:18,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 20:55:18,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 20:55:18,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 20:55:18,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 20:55:18,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 20:55:18,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 20:55:18,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 20:55:18,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 20:55:18,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 20:55:18,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 20:55:18,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 20:55:18,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 20:55:18,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 20:55:18,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 20:55:18,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 20:55:18,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 20:55:18,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 20:55:18,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 20:55:18,830 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 20:55:18,830 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 20:55:18,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 20:55:18,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 20:55:18,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 20:55:18,832 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-NoLbe.epf [2022-12-11 20:55:18,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 20:55:18,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 20:55:18,860 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 20:55:18,860 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 20:55:18,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 20:55:18,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 20:55:18,861 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 20:55:18,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 20:55:18,862 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 20:55:18,862 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 20:55:18,862 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 20:55:18,862 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 20:55:18,862 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 20:55:18,863 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 20:55:18,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:55:18,864 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 20:55:18,864 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 20:55:18,864 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 20:55:18,864 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 20:55:18,864 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 20:55:18,864 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 20:55:18,875 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 20:55:18,875 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-11 20:55:19,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 20:55:19,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 20:55:19,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 20:55:19,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 20:55:19,157 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 20:55:19,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-11 20:55:20,118 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 20:55:20,383 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 20:55:20,384 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-11 20:55:20,398 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc1e44b2/c12dbda3a90b45a68ace1b5b7523d444/FLAGf42339a05 [2022-12-11 20:55:20,412 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc1e44b2/c12dbda3a90b45a68ace1b5b7523d444 [2022-12-11 20:55:20,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 20:55:20,414 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 20:55:20,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 20:55:20,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 20:55:20,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 20:55:20,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a74f932 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20, skipping insertion in model container [2022-12-11 20:55:20,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 20:55:20,460 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 20:55:20,563 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/mix021_tso.oepc.i[949,962] [2022-12-11 20:55:20,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,645 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:55:20,685 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 20:55:20,701 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/mix021_tso.oepc.i[949,962] [2022-12-11 20:55:20,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,737 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,738 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 20:55:20,754 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 20:55:20,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 20:55:20,788 INFO L208 MainTranslator]: Completed translation [2022-12-11 20:55:20,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20 WrapperNode [2022-12-11 20:55:20,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 20:55:20,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 20:55:20,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 20:55:20,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 20:55:20,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,854 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-11 20:55:20,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 20:55:20,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 20:55:20,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 20:55:20,855 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 20:55:20,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,883 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,885 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 20:55:20,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 20:55:20,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 20:55:20,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 20:55:20,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (1/1) ... [2022-12-11 20:55:20,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 20:55:20,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 20:55:20,952 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-11 20:55:20,971 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-11 20:55:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 20:55:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 20:55:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 20:55:20,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 20:55:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 20:55:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-11 20:55:20,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-11 20:55:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-11 20:55:20,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-11 20:55:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-11 20:55:20,984 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-11 20:55:20,984 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-11 20:55:20,985 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-11 20:55:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 20:55:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 20:55:20,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 20:55:20,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 20:55:20,986 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 20:55:21,077 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 20:55:21,078 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 20:55:21,367 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 20:55:21,487 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 20:55:21,487 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-11 20:55:21,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:55:21 BoogieIcfgContainer [2022-12-11 20:55:21,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 20:55:21,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 20:55:21,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 20:55:21,493 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 20:55:21,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 08:55:20" (1/3) ... [2022-12-11 20:55:21,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1189ee78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:55:21, skipping insertion in model container [2022-12-11 20:55:21,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 08:55:20" (2/3) ... [2022-12-11 20:55:21,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1189ee78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 08:55:21, skipping insertion in model container [2022-12-11 20:55:21,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 08:55:21" (3/3) ... [2022-12-11 20:55:21,495 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-12-11 20:55:21,508 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 20:55:21,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-11 20:55:21,509 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 20:55:21,560 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-11 20:55:21,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-11 20:55:21,623 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-11 20:55:21,623 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:55:21,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-11 20:55:21,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-11 20:55:21,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-11 20:55:21,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 20:55:21,644 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=PETRI_NET, 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;@5d0cbc1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 20:55:21,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-11 20:55:21,660 INFO L130 PetriNetUnfolder]: 0/74 cut-off events. [2022-12-11 20:55:21,660 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-11 20:55:21,660 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:21,660 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:21,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash 941174222, now seen corresponding path program 1 times [2022-12-11 20:55:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:21,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932531520] [2022-12-11 20:55:21,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:21,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:22,200 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-11 20:55:22,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:22,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932531520] [2022-12-11 20:55:22,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932531520] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:22,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:22,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 20:55:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102697030] [2022-12-11 20:55:22,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:22,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 20:55:22,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:22,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 20:55:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 20:55:22,234 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 129 [2022-12-11 20:55:22,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-11 20:55:22,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:22,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 129 [2022-12-11 20:55:22,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:22,425 INFO L130 PetriNetUnfolder]: 57/484 cut-off events. [2022-12-11 20:55:22,426 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-11 20:55:22,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 484 events. 57/484 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2454 event pairs, 31 based on Foata normal form. 16/470 useless extension candidates. Maximal degree in co-relation 559. Up to 75 conditions per place. [2022-12-11 20:55:22,434 INFO L137 encePairwiseOnDemand]: 124/129 looper letters, 14 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2022-12-11 20:55:22,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 299 flow [2022-12-11 20:55:22,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 20:55:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 20:55:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-12-11 20:55:22,447 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2022-12-11 20:55:22,452 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2022-12-11 20:55:22,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 126 transitions, 299 flow [2022-12-11 20:55:22,457 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 126 transitions, 299 flow [2022-12-11 20:55:22,458 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 126 transitions, 299 flow [2022-12-11 20:55:22,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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-11 20:55:22,458 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:22,459 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:22,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 20:55:22,459 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:22,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash -93586980, now seen corresponding path program 1 times [2022-12-11 20:55:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:22,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794434861] [2022-12-11 20:55:22,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:23,637 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-11 20:55:23,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:23,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794434861] [2022-12-11 20:55:23,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794434861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:23,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:23,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 20:55:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567772478] [2022-12-11 20:55:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:23,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 20:55:23,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:23,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 20:55:23,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-12-11 20:55:23,644 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 129 [2022-12-11 20:55:23,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 126 transitions, 299 flow. Second operand has 10 states, 10 states have (on average 94.2) internal successors, (942), 10 states have internal predecessors, (942), 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-11 20:55:23,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:23,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 129 [2022-12-11 20:55:23,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:26,037 INFO L130 PetriNetUnfolder]: 6857/15915 cut-off events. [2022-12-11 20:55:26,037 INFO L131 PetriNetUnfolder]: For 2249/4193 co-relation queries the response was YES. [2022-12-11 20:55:26,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28772 conditions, 15915 events. 6857/15915 cut-off events. For 2249/4193 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 160898 event pairs, 506 based on Foata normal form. 7/15624 useless extension candidates. Maximal degree in co-relation 28704. Up to 3837 conditions per place. [2022-12-11 20:55:26,115 INFO L137 encePairwiseOnDemand]: 106/129 looper letters, 52 selfloop transitions, 37 changer transitions 178/344 dead transitions. [2022-12-11 20:55:26,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 344 transitions, 1434 flow [2022-12-11 20:55:26,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-11 20:55:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-11 20:55:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2355 transitions. [2022-12-11 20:55:26,120 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7937310414560161 [2022-12-11 20:55:26,120 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 22 predicate places. [2022-12-11 20:55:26,120 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 344 transitions, 1434 flow [2022-12-11 20:55:26,149 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 166 transitions, 628 flow [2022-12-11 20:55:26,149 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 166 transitions, 628 flow [2022-12-11 20:55:26,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 94.2) internal successors, (942), 10 states have internal predecessors, (942), 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-11 20:55:26,150 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:26,150 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:26,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 20:55:26,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1528192036, now seen corresponding path program 1 times [2022-12-11 20:55:26,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:26,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274695588] [2022-12-11 20:55:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:26,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:26,567 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-11 20:55:26,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:26,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274695588] [2022-12-11 20:55:26,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274695588] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:26,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:26,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:55:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231882959] [2022-12-11 20:55:26,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:26,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:55:26,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:26,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:55:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:55:26,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 129 [2022-12-11 20:55:26,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 166 transitions, 628 flow. Second operand has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 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-11 20:55:26,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:26,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 129 [2022-12-11 20:55:26,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:27,812 INFO L130 PetriNetUnfolder]: 4209/7917 cut-off events. [2022-12-11 20:55:27,813 INFO L131 PetriNetUnfolder]: For 2341/9852 co-relation queries the response was YES. [2022-12-11 20:55:27,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22415 conditions, 7917 events. 4209/7917 cut-off events. For 2341/9852 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 60553 event pairs, 268 based on Foata normal form. 186/7945 useless extension candidates. Maximal degree in co-relation 22333. Up to 4564 conditions per place. [2022-12-11 20:55:27,849 INFO L137 encePairwiseOnDemand]: 114/129 looper letters, 114 selfloop transitions, 33 changer transitions 129/353 dead transitions. [2022-12-11 20:55:27,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 353 transitions, 2114 flow [2022-12-11 20:55:27,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:55:27,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:55:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1337 transitions. [2022-12-11 20:55:27,852 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7972570065593322 [2022-12-11 20:55:27,853 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 7 predicate places. [2022-12-11 20:55:27,853 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 353 transitions, 2114 flow [2022-12-11 20:55:27,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 224 transitions, 1214 flow [2022-12-11 20:55:27,878 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 224 transitions, 1214 flow [2022-12-11 20:55:27,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.28571428571429) internal successors, (667), 7 states have internal predecessors, (667), 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-11 20:55:27,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:27,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:27,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 20:55:27,879 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:27,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:27,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1505245890, now seen corresponding path program 1 times [2022-12-11 20:55:27,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:27,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665789583] [2022-12-11 20:55:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:27,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:28,046 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-11 20:55:28,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:28,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665789583] [2022-12-11 20:55:28,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665789583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:28,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:28,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:55:28,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513683943] [2022-12-11 20:55:28,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:28,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:55:28,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:28,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:55:28,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:55:28,049 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2022-12-11 20:55:28,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 224 transitions, 1214 flow. Second operand has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 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-11 20:55:28,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:28,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2022-12-11 20:55:28,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:28,759 INFO L130 PetriNetUnfolder]: 3343/6612 cut-off events. [2022-12-11 20:55:28,759 INFO L131 PetriNetUnfolder]: For 4733/14184 co-relation queries the response was YES. [2022-12-11 20:55:28,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21813 conditions, 6612 events. 3343/6612 cut-off events. For 4733/14184 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 49773 event pairs, 317 based on Foata normal form. 167/6608 useless extension candidates. Maximal degree in co-relation 21727. Up to 3654 conditions per place. [2022-12-11 20:55:28,803 INFO L137 encePairwiseOnDemand]: 122/129 looper letters, 125 selfloop transitions, 17 changer transitions 50/314 dead transitions. [2022-12-11 20:55:28,803 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 314 transitions, 2256 flow [2022-12-11 20:55:28,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:55:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:55:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1017 transitions. [2022-12-11 20:55:28,806 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.875968992248062 [2022-12-11 20:55:28,807 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2022-12-11 20:55:28,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 314 transitions, 2256 flow [2022-12-11 20:55:28,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 264 transitions, 1804 flow [2022-12-11 20:55:28,834 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 264 transitions, 1804 flow [2022-12-11 20:55:28,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 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-11 20:55:28,834 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:28,835 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:28,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 20:55:28,835 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:28,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:28,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1710659781, now seen corresponding path program 1 times [2022-12-11 20:55:28,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:28,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900476830] [2022-12-11 20:55:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:28,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:29,380 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-11 20:55:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:29,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900476830] [2022-12-11 20:55:29,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900476830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:29,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:29,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 20:55:29,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787581307] [2022-12-11 20:55:29,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:29,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 20:55:29,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:29,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 20:55:29,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-11 20:55:29,383 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 129 [2022-12-11 20:55:29,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 264 transitions, 1804 flow. Second operand has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 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-11 20:55:29,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:29,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 129 [2022-12-11 20:55:29,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:30,526 INFO L130 PetriNetUnfolder]: 3808/7999 cut-off events. [2022-12-11 20:55:30,526 INFO L131 PetriNetUnfolder]: For 9779/100641 co-relation queries the response was YES. [2022-12-11 20:55:30,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31597 conditions, 7999 events. 3808/7999 cut-off events. For 9779/100641 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 67098 event pairs, 180 based on Foata normal form. 327/8197 useless extension candidates. Maximal degree in co-relation 31498. Up to 4436 conditions per place. [2022-12-11 20:55:30,571 INFO L137 encePairwiseOnDemand]: 114/129 looper letters, 176 selfloop transitions, 103 changer transitions 157/514 dead transitions. [2022-12-11 20:55:30,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 514 transitions, 4870 flow [2022-12-11 20:55:30,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 20:55:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 20:55:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1544 transitions. [2022-12-11 20:55:30,574 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7979328165374677 [2022-12-11 20:55:30,574 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 14 predicate places. [2022-12-11 20:55:30,574 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 514 transitions, 4870 flow [2022-12-11 20:55:30,604 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 357 transitions, 3184 flow [2022-12-11 20:55:30,604 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 357 transitions, 3184 flow [2022-12-11 20:55:30,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 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-11 20:55:30,605 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:30,605 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:30,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 20:55:30,605 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:30,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:30,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1563608896, now seen corresponding path program 1 times [2022-12-11 20:55:30,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:30,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449697284] [2022-12-11 20:55:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:30,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:31,317 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-11 20:55:31,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:31,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449697284] [2022-12-11 20:55:31,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449697284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:31,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:31,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-11 20:55:31,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843239119] [2022-12-11 20:55:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:31,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-11 20:55:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:31,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-11 20:55:31,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-11 20:55:31,320 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2022-12-11 20:55:31,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 357 transitions, 3184 flow. Second operand has 12 states, 12 states have (on average 104.5) internal successors, (1254), 12 states have internal predecessors, (1254), 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-11 20:55:31,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:31,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2022-12-11 20:55:31,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:32,465 INFO L130 PetriNetUnfolder]: 2954/6430 cut-off events. [2022-12-11 20:55:32,466 INFO L131 PetriNetUnfolder]: For 18785/88201 co-relation queries the response was YES. [2022-12-11 20:55:32,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27739 conditions, 6430 events. 2954/6430 cut-off events. For 18785/88201 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 52351 event pairs, 144 based on Foata normal form. 454/6721 useless extension candidates. Maximal degree in co-relation 27632. Up to 3307 conditions per place. [2022-12-11 20:55:32,513 INFO L137 encePairwiseOnDemand]: 116/129 looper letters, 148 selfloop transitions, 70 changer transitions 77/463 dead transitions. [2022-12-11 20:55:32,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 463 transitions, 4976 flow [2022-12-11 20:55:32,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 20:55:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 20:55:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2145 transitions. [2022-12-11 20:55:32,517 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8313953488372093 [2022-12-11 20:55:32,520 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 24 predicate places. [2022-12-11 20:55:32,520 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 463 transitions, 4976 flow [2022-12-11 20:55:32,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 386 transitions, 3958 flow [2022-12-11 20:55:32,635 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 386 transitions, 3958 flow [2022-12-11 20:55:32,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 104.5) internal successors, (1254), 12 states have internal predecessors, (1254), 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-11 20:55:32,636 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:32,637 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:32,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 20:55:32,642 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:32,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:32,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1973069193, now seen corresponding path program 1 times [2022-12-11 20:55:32,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:32,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103530346] [2022-12-11 20:55:32,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:32,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:33,006 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-11 20:55:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:33,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103530346] [2022-12-11 20:55:33,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103530346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:33,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:33,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 20:55:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285875109] [2022-12-11 20:55:33,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:33,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 20:55:33,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 20:55:33,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-11 20:55:33,012 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2022-12-11 20:55:33,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 386 transitions, 3958 flow. Second operand has 9 states, 9 states have (on average 105.77777777777777) internal successors, (952), 9 states have internal predecessors, (952), 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-11 20:55:33,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:33,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2022-12-11 20:55:33,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:33,890 INFO L130 PetriNetUnfolder]: 3182/7292 cut-off events. [2022-12-11 20:55:33,890 INFO L131 PetriNetUnfolder]: For 25516/49390 co-relation queries the response was YES. [2022-12-11 20:55:33,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33319 conditions, 7292 events. 3182/7292 cut-off events. For 25516/49390 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 63350 event pairs, 144 based on Foata normal form. 623/7742 useless extension candidates. Maximal degree in co-relation 33205. Up to 3576 conditions per place. [2022-12-11 20:55:33,996 INFO L137 encePairwiseOnDemand]: 117/129 looper letters, 180 selfloop transitions, 53 changer transitions 80/482 dead transitions. [2022-12-11 20:55:33,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 482 transitions, 5820 flow [2022-12-11 20:55:33,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:55:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:55:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1413 transitions. [2022-12-11 20:55:34,001 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8425760286225402 [2022-12-11 20:55:34,002 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 24 predicate places. [2022-12-11 20:55:34,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 482 transitions, 5820 flow [2022-12-11 20:55:34,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 402 transitions, 4624 flow [2022-12-11 20:55:34,031 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 402 transitions, 4624 flow [2022-12-11 20:55:34,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.77777777777777) internal successors, (952), 9 states have internal predecessors, (952), 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-11 20:55:34,031 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:34,031 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:34,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-11 20:55:34,032 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:34,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1814967568, now seen corresponding path program 1 times [2022-12-11 20:55:34,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:34,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216728153] [2022-12-11 20:55:34,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:34,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:34,517 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-11 20:55:34,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:34,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216728153] [2022-12-11 20:55:34,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216728153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:34,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:34,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-11 20:55:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144772172] [2022-12-11 20:55:34,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:34,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 20:55:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:34,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 20:55:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-12-11 20:55:34,519 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 129 [2022-12-11 20:55:34,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 402 transitions, 4624 flow. Second operand has 11 states, 11 states have (on average 105.54545454545455) internal successors, (1161), 11 states have internal predecessors, (1161), 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-11 20:55:34,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:34,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 129 [2022-12-11 20:55:34,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:35,260 INFO L130 PetriNetUnfolder]: 2317/5199 cut-off events. [2022-12-11 20:55:35,260 INFO L131 PetriNetUnfolder]: For 26624/82288 co-relation queries the response was YES. [2022-12-11 20:55:35,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26818 conditions, 5199 events. 2317/5199 cut-off events. For 26624/82288 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 41943 event pairs, 131 based on Foata normal form. 304/5383 useless extension candidates. Maximal degree in co-relation 26697. Up to 2578 conditions per place. [2022-12-11 20:55:35,299 INFO L137 encePairwiseOnDemand]: 119/129 looper letters, 198 selfloop transitions, 40 changer transitions 55/462 dead transitions. [2022-12-11 20:55:35,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 462 transitions, 6128 flow [2022-12-11 20:55:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 20:55:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 20:55:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1623 transitions. [2022-12-11 20:55:35,349 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8387596899224806 [2022-12-11 20:55:35,349 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 32 predicate places. [2022-12-11 20:55:35,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 462 transitions, 6128 flow [2022-12-11 20:55:35,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 407 transitions, 5180 flow [2022-12-11 20:55:35,376 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 407 transitions, 5180 flow [2022-12-11 20:55:35,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 105.54545454545455) internal successors, (1161), 11 states have internal predecessors, (1161), 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-11 20:55:35,376 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:35,377 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:35,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-11 20:55:35,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1009391679, now seen corresponding path program 1 times [2022-12-11 20:55:35,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:35,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97741763] [2022-12-11 20:55:35,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:36,052 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-11 20:55:36,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:36,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97741763] [2022-12-11 20:55:36,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97741763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:36,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:36,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-11 20:55:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628162043] [2022-12-11 20:55:36,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:36,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-11 20:55:36,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:36,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-11 20:55:36,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-12-11 20:55:36,055 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 129 [2022-12-11 20:55:36,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 407 transitions, 5180 flow. Second operand has 15 states, 15 states have (on average 102.4) internal successors, (1536), 15 states have internal predecessors, (1536), 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-11 20:55:36,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:36,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 129 [2022-12-11 20:55:36,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:36,923 INFO L130 PetriNetUnfolder]: 2316/5764 cut-off events. [2022-12-11 20:55:36,924 INFO L131 PetriNetUnfolder]: For 45127/83931 co-relation queries the response was YES. [2022-12-11 20:55:36,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30122 conditions, 5764 events. 2316/5764 cut-off events. For 45127/83931 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 50441 event pairs, 144 based on Foata normal form. 338/5930 useless extension candidates. Maximal degree in co-relation 29991. Up to 2616 conditions per place. [2022-12-11 20:55:36,956 INFO L137 encePairwiseOnDemand]: 117/129 looper letters, 205 selfloop transitions, 43 changer transitions 62/476 dead transitions. [2022-12-11 20:55:36,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 476 transitions, 7014 flow [2022-12-11 20:55:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 20:55:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 20:55:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1576 transitions. [2022-12-11 20:55:36,959 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.814470284237726 [2022-12-11 20:55:36,960 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 37 predicate places. [2022-12-11 20:55:36,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 476 transitions, 7014 flow [2022-12-11 20:55:36,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 414 transitions, 5828 flow [2022-12-11 20:55:36,986 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 414 transitions, 5828 flow [2022-12-11 20:55:36,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 102.4) internal successors, (1536), 15 states have internal predecessors, (1536), 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-11 20:55:36,987 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:36,987 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:36,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-11 20:55:36,987 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2138605500, now seen corresponding path program 1 times [2022-12-11 20:55:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:36,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179685367] [2022-12-11 20:55:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:37,099 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-11 20:55:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:37,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179685367] [2022-12-11 20:55:37,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179685367] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:37,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:37,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:55:37,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717919940] [2022-12-11 20:55:37,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:37,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:55:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:37,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:55:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:55:37,101 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2022-12-11 20:55:37,101 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 414 transitions, 5828 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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-11 20:55:37,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:37,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2022-12-11 20:55:37,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:40,593 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][456], [319#true, 298#true, P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, 71#L3true, 36#L806true, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 143#true, 22#L759true, 45#L822true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:40,594 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 20:55:40,594 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:40,594 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:40,594 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:40,594 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][460], [319#true, 298#true, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, 71#L3true, P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 12#L829true, 22#L759true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:40,594 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 20:55:40,594 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:40,594 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:40,594 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:40,936 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][771], [319#true, 298#true, P0Thread1of1ForFork3InUse, 190#true, 213#true, P2Thread1of1ForFork2InUse, 56#L779true, 36#L806true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 143#true, 380#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 22#L759true, 45#L822true, 129#L3-1true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:40,937 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,937 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,937 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,937 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,937 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][456], [319#true, 37#L2-1true, 298#true, P0Thread1of1ForFork3InUse, 190#true, 213#true, P2Thread1of1ForFork2InUse, 56#L779true, 36#L806true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 143#true, 22#L759true, 45#L822true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:40,937 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,938 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,938 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,938 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,938 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][767], [319#true, 298#true, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 12#L829true, 380#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 22#L759true, 129#L3-1true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:40,939 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,939 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,939 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,939 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,939 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][460], [319#true, 37#L2-1true, 298#true, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 12#L829true, 22#L759true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:40,939 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,939 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,939 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:40,939 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:41,153 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L858-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_56 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_132 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_115)) (= v_~y~0_73 (ite .cse2 v_~y$w_buff0~0_49 (ite .cse1 v_~y$w_buff1~0_54 v_~y~0_74))) (= (ite .cse2 0 v_~y$w_buff0_used~0_132) v_~y$w_buff0_used~0_131) (= v_~y$r_buff0_thd0~0_55 (ite .cse0 0 v_~y$r_buff0_thd0~0_56)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_73, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][829], [319#true, 114#L864true, 298#true, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, 273#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 22#L759true, 45#L822true, 375#true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:41,153 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 20:55:41,153 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:55:41,153 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:55:41,153 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:55:42,006 INFO L130 PetriNetUnfolder]: 22308/37080 cut-off events. [2022-12-11 20:55:42,006 INFO L131 PetriNetUnfolder]: For 673100/735850 co-relation queries the response was YES. [2022-12-11 20:55:42,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197627 conditions, 37080 events. 22308/37080 cut-off events. For 673100/735850 co-relation queries the response was YES. Maximal size of possible extension queue 2778. Compared 328684 event pairs, 836 based on Foata normal form. 2911/37318 useless extension candidates. Maximal degree in co-relation 197492. Up to 14430 conditions per place. [2022-12-11 20:55:42,294 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 603 selfloop transitions, 20 changer transitions 187/1016 dead transitions. [2022-12-11 20:55:42,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 1016 transitions, 18898 flow [2022-12-11 20:55:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-11 20:55:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-11 20:55:42,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1122 transitions. [2022-12-11 20:55:42,296 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8697674418604651 [2022-12-11 20:55:42,298 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 40 predicate places. [2022-12-11 20:55:42,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 1016 transitions, 18898 flow [2022-12-11 20:55:42,455 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 829 transitions, 14784 flow [2022-12-11 20:55:42,456 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 829 transitions, 14784 flow [2022-12-11 20:55:42,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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-11 20:55:42,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:42,456 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:42,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-11 20:55:42,458 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:42,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1676170686, now seen corresponding path program 1 times [2022-12-11 20:55:42,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:42,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055302820] [2022-12-11 20:55:42,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:42,697 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-11 20:55:42,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:42,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055302820] [2022-12-11 20:55:42,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055302820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:42,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:42,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:55:42,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505272490] [2022-12-11 20:55:42,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:42,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:55:42,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:42,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:55:42,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:55:42,700 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2022-12-11 20:55:42,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 829 transitions, 14784 flow. Second operand has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 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-11 20:55:42,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:42,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2022-12-11 20:55:42,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:44,972 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][390], [319#true, 18#L766true, 298#true, 403#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 104#L754true, P0Thread1of1ForFork3InUse, 190#true, 213#true, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 25#L799true, 143#true, 12#L829true, 384#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 82#L2true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:44,972 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-11 20:55:44,972 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:55:44,972 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:55:44,972 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-11 20:55:45,206 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][535], [319#true, 18#L766true, 298#true, 104#L754true, 405#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork3InUse, 190#true, 213#true, P2Thread1of1ForFork2InUse, 71#L3true, P1Thread1of1ForFork1InUse, 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 25#L799true, 143#true, 12#L829true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:45,206 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-11 20:55:45,206 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:55:45,206 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:55:45,206 INFO L385 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-12-11 20:55:45,732 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][535], [319#true, 18#L766true, 298#true, 104#L754true, 405#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork3InUse, 190#true, 213#true, P2Thread1of1ForFork2InUse, 386#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 25#L799true, 143#true, 12#L829true, 129#L3-1true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:45,732 INFO L382 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-12-11 20:55:45,732 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:55:45,732 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:55:45,732 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-11 20:55:48,149 INFO L130 PetriNetUnfolder]: 16921/33357 cut-off events. [2022-12-11 20:55:48,149 INFO L131 PetriNetUnfolder]: For 475060/536480 co-relation queries the response was YES. [2022-12-11 20:55:48,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167578 conditions, 33357 events. 16921/33357 cut-off events. For 475060/536480 co-relation queries the response was YES. Maximal size of possible extension queue 2646. Compared 355760 event pairs, 280 based on Foata normal form. 5306/37173 useless extension candidates. Maximal degree in co-relation 167439. Up to 10848 conditions per place. [2022-12-11 20:55:48,357 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 910 selfloop transitions, 54 changer transitions 232/1398 dead transitions. [2022-12-11 20:55:48,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1398 transitions, 28733 flow [2022-12-11 20:55:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 20:55:48,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 20:55:48,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1462 transitions. [2022-12-11 20:55:48,360 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2022-12-11 20:55:48,360 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 52 predicate places. [2022-12-11 20:55:48,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 188 places, 1398 transitions, 28733 flow [2022-12-11 20:55:48,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 188 places, 1166 transitions, 23165 flow [2022-12-11 20:55:48,464 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 1166 transitions, 23165 flow [2022-12-11 20:55:48,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 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-11 20:55:48,464 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:48,464 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:48,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 20:55:48,464 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:48,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash -631899807, now seen corresponding path program 1 times [2022-12-11 20:55:48,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:48,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083609059] [2022-12-11 20:55:48,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:48,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:48,589 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-11 20:55:48,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:48,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083609059] [2022-12-11 20:55:48,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083609059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:48,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:48,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 20:55:48,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411993695] [2022-12-11 20:55:48,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:48,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 20:55:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 20:55:48,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-11 20:55:48,591 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 129 [2022-12-11 20:55:48,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 1166 transitions, 23165 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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-11 20:55:48,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:48,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 129 [2022-12-11 20:55:48,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:55:51,741 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][1002], [319#true, 298#true, P0Thread1of1ForFork3InUse, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, 105#L857true, P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 391#true, 12#L829true, 22#L759true, 416#(= ~x~0 1), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:51,741 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-12-11 20:55:51,741 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:55:51,741 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:55:51,741 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-12-11 20:55:52,114 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][1002], [319#true, 298#true, P0Thread1of1ForFork3InUse, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 391#true, 12#L829true, 22#L759true, 416#(= ~x~0 1), 82#L2true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:52,114 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-12-11 20:55:52,114 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:55:52,114 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:55:52,114 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-12-11 20:55:52,115 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][1130], [319#true, 298#true, P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, 36#L806true, P1Thread1of1ForFork1InUse, 105#L857true, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 143#true, 391#true, 22#L759true, 416#(= ~x~0 1), 45#L822true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:52,115 INFO L382 tUnfolder$Statistics]: this new event has 86 ancestors and is not cut-off event [2022-12-11 20:55:52,115 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-12-11 20:55:52,115 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-12-11 20:55:52,115 INFO L385 tUnfolder$Statistics]: existing Event has 86 ancestors and is not cut-off event [2022-12-11 20:55:52,653 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][1002], [319#true, 298#true, P0Thread1of1ForFork3InUse, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, 71#L3true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 391#true, 12#L829true, 22#L759true, 416#(= ~x~0 1), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:52,653 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is cut-off event [2022-12-11 20:55:52,653 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:52,653 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:52,653 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-11 20:55:52,654 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][1130], [319#true, 298#true, P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, 36#L806true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 143#true, 391#true, 22#L759true, 416#(= ~x~0 1), 45#L822true, 82#L2true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:52,654 INFO L382 tUnfolder$Statistics]: this new event has 87 ancestors and is not cut-off event [2022-12-11 20:55:52,655 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2022-12-11 20:55:52,655 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2022-12-11 20:55:52,655 INFO L385 tUnfolder$Statistics]: existing Event has 87 ancestors and is not cut-off event [2022-12-11 20:55:52,962 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][1373], [319#true, 397#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 298#true, P0Thread1of1ForFork3InUse, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 12#L829true, 380#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 22#L759true, 416#(= ~x~0 1), 129#L3-1true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:52,962 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,962 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,962 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,962 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,962 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([389] L822-->L829: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_28 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0)))) (let ((.cse2 (and (not (= (mod v_~y$w_buff1_used~0_119 256) 0)) .cse4)) (.cse0 (and .cse3 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5))) (and (= (ite .cse0 0 v_~y$r_buff0_thd4~0_28) v_~y$r_buff0_thd4~0_27) (= v_~y~0_77 (ite .cse1 v_~y$w_buff0~0_51 (ite .cse2 v_~y$w_buff1~0_56 v_~y~0_78))) (= (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_119) v_~y$w_buff1_used~0_118) (= v_~y$w_buff0_used~0_135 (ite .cse1 0 v_~y$w_buff0_used~0_136)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_27 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_118 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_28, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_27, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][1002], [319#true, 298#true, 37#L2-1true, P0Thread1of1ForFork3InUse, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 391#true, 12#L829true, 22#L759true, 416#(= ~x~0 1), 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:52,962 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,962 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,962 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,962 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,964 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][1130], [319#true, 298#true, P0Thread1of1ForFork3InUse, 190#true, 213#true, P2Thread1of1ForFork2InUse, 56#L779true, 36#L806true, 71#L3true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 143#true, 391#true, 416#(= ~x~0 1), 22#L759true, 45#L822true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:52,964 INFO L382 tUnfolder$Statistics]: this new event has 88 ancestors and is not cut-off event [2022-12-11 20:55:52,964 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-12-11 20:55:52,964 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-12-11 20:55:52,964 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is not cut-off event [2022-12-11 20:55:52,964 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][1436], [319#true, 397#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 298#true, P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, 36#L806true, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 143#true, 380#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 22#L759true, 416#(= ~x~0 1), 45#L822true, 129#L3-1true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:52,964 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,964 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,964 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:52,964 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-12-11 20:55:53,230 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([381] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][1130], [319#true, 298#true, 37#L2-1true, P0Thread1of1ForFork3InUse, 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, 36#L806true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 146#true, 353#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0)), 143#true, 391#true, 22#L759true, 416#(= ~x~0 1), 45#L822true, 261#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0))]) [2022-12-11 20:55:53,231 INFO L382 tUnfolder$Statistics]: this new event has 89 ancestors and is not cut-off event [2022-12-11 20:55:53,231 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2022-12-11 20:55:53,231 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2022-12-11 20:55:53,231 INFO L385 tUnfolder$Statistics]: existing Event has 89 ancestors and is not cut-off event [2022-12-11 20:55:53,233 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([322] L858-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_131 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_56 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd0~0_52 256) 0)))) (let ((.cse1 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_132 256) 0)) .cse5)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$w_buff1_used~0_114 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_115)) (= v_~y~0_73 (ite .cse2 v_~y$w_buff0~0_49 (ite .cse1 v_~y$w_buff1~0_54 v_~y~0_74))) (= (ite .cse2 0 v_~y$w_buff0_used~0_132) v_~y$w_buff0_used~0_131) (= v_~y$r_buff0_thd0~0_55 (ite .cse0 0 v_~y$r_buff0_thd0~0_56)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_55 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_52) v_~y$r_buff1_thd0~0_51)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_132, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_74, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_131, ~y$w_buff1~0=v_~y$w_buff1~0_54, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_73, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_51, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][1439], [114#L864true, 319#true, 298#true, P0Thread1of1ForFork3InUse, 362#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 190#true, P2Thread1of1ForFork2InUse, 213#true, 56#L779true, P1Thread1of1ForFork1InUse, 273#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), P3Thread1of1ForFork0InUse, 146#true, 25#L799true, 143#true, 391#true, 22#L759true, 416#(= ~x~0 1), 45#L822true, 232#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), 375#true]) [2022-12-11 20:55:53,233 INFO L382 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-12-11 20:55:53,233 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:55:53,233 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:55:53,233 INFO L385 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-12-11 20:55:54,259 INFO L130 PetriNetUnfolder]: 21418/43507 cut-off events. [2022-12-11 20:55:54,260 INFO L131 PetriNetUnfolder]: For 683739/758393 co-relation queries the response was YES. [2022-12-11 20:55:54,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222702 conditions, 43507 events. 21418/43507 cut-off events. For 683739/758393 co-relation queries the response was YES. Maximal size of possible extension queue 3274. Compared 490287 event pairs, 395 based on Foata normal form. 3230/44970 useless extension candidates. Maximal degree in co-relation 222559. Up to 14672 conditions per place. [2022-12-11 20:55:54,498 INFO L137 encePairwiseOnDemand]: 123/129 looper letters, 878 selfloop transitions, 36 changer transitions 527/1674 dead transitions. [2022-12-11 20:55:54,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1674 transitions, 38106 flow [2022-12-11 20:55:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:55:54,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:55:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1015 transitions. [2022-12-11 20:55:54,510 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8742463393626184 [2022-12-11 20:55:54,511 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 60 predicate places. [2022-12-11 20:55:54,511 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 1674 transitions, 38106 flow [2022-12-11 20:55:54,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 1147 transitions, 24624 flow [2022-12-11 20:55:54,654 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 1147 transitions, 24624 flow [2022-12-11 20:55:54,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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-11 20:55:54,654 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:55:54,654 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:55:54,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-11 20:55:54,654 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:55:54,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:55:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1133459889, now seen corresponding path program 1 times [2022-12-11 20:55:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:55:54,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709319163] [2022-12-11 20:55:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:55:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:55:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:55:54,811 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-11 20:55:54,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:55:54,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709319163] [2022-12-11 20:55:54,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709319163] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:55:54,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:55:54,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:55:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797271780] [2022-12-11 20:55:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:55:54,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:55:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:55:54,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:55:54,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:55:54,814 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2022-12-11 20:55:54,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 1147 transitions, 24624 flow. Second operand has 8 states, 8 states have (on average 105.25) internal successors, (842), 8 states have internal predecessors, (842), 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-11 20:55:54,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:55:54,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2022-12-11 20:55:54,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:56:01,613 INFO L130 PetriNetUnfolder]: 15089/34384 cut-off events. [2022-12-11 20:56:01,613 INFO L131 PetriNetUnfolder]: For 419076/498555 co-relation queries the response was YES. [2022-12-11 20:56:01,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170483 conditions, 34384 events. 15089/34384 cut-off events. For 419076/498555 co-relation queries the response was YES. Maximal size of possible extension queue 2691. Compared 416227 event pairs, 171 based on Foata normal form. 5327/38642 useless extension candidates. Maximal degree in co-relation 170336. Up to 9871 conditions per place. [2022-12-11 20:56:01,801 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 654 selfloop transitions, 104 changer transitions 425/1367 dead transitions. [2022-12-11 20:56:01,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 1367 transitions, 31345 flow [2022-12-11 20:56:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-11 20:56:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-11 20:56:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1801 transitions. [2022-12-11 20:56:01,803 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.872577519379845 [2022-12-11 20:56:01,805 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 69 predicate places. [2022-12-11 20:56:01,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 1367 transitions, 31345 flow [2022-12-11 20:56:01,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 942 transitions, 20269 flow [2022-12-11 20:56:01,876 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 942 transitions, 20269 flow [2022-12-11 20:56:01,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.25) internal successors, (842), 8 states have internal predecessors, (842), 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-11 20:56:01,876 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:56:01,877 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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-11 20:56:01,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-11 20:56:01,877 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:56:01,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:56:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 628411460, now seen corresponding path program 1 times [2022-12-11 20:56:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:56:01,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115450389] [2022-12-11 20:56:01,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:56:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:56:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:56:02,299 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-11 20:56:02,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:56:02,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115450389] [2022-12-11 20:56:02,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115450389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:56:02,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:56:02,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-11 20:56:02,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397637049] [2022-12-11 20:56:02,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:56:02,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-11 20:56:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:56:02,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-11 20:56:02,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-11 20:56:02,301 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 129 [2022-12-11 20:56:02,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 942 transitions, 20269 flow. Second operand has 9 states, 9 states have (on average 105.22222222222223) internal successors, (947), 9 states have internal predecessors, (947), 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-11 20:56:02,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:56:02,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 129 [2022-12-11 20:56:02,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:56:07,183 INFO L130 PetriNetUnfolder]: 12252/29340 cut-off events. [2022-12-11 20:56:07,184 INFO L131 PetriNetUnfolder]: For 288619/350175 co-relation queries the response was YES. [2022-12-11 20:56:07,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156290 conditions, 29340 events. 12252/29340 cut-off events. For 288619/350175 co-relation queries the response was YES. Maximal size of possible extension queue 2354. Compared 360991 event pairs, 126 based on Foata normal form. 4341/32713 useless extension candidates. Maximal degree in co-relation 156139. Up to 7954 conditions per place. [2022-12-11 20:56:07,320 INFO L137 encePairwiseOnDemand]: 118/129 looper letters, 488 selfloop transitions, 97 changer transitions 236/960 dead transitions. [2022-12-11 20:56:07,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 960 transitions, 22043 flow [2022-12-11 20:56:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-11 20:56:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-11 20:56:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2099 transitions. [2022-12-11 20:56:07,322 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8563851489188087 [2022-12-11 20:56:07,323 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 87 predicate places. [2022-12-11 20:56:07,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 960 transitions, 22043 flow [2022-12-11 20:56:07,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 724 transitions, 16196 flow [2022-12-11 20:56:07,374 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 724 transitions, 16196 flow [2022-12-11 20:56:07,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.22222222222223) internal successors, (947), 9 states have internal predecessors, (947), 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-11 20:56:07,375 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:56:07,375 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1] [2022-12-11 20:56:07,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-11 20:56:07,375 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:56:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:56:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash 187402180, now seen corresponding path program 1 times [2022-12-11 20:56:07,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:56:07,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209330752] [2022-12-11 20:56:07,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:56:07,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:56:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:56:07,527 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-11 20:56:07,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:56:07,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209330752] [2022-12-11 20:56:07,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209330752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:56:07,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:56:07,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-11 20:56:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483896317] [2022-12-11 20:56:07,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:56:07,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-11 20:56:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:56:07,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-11 20:56:07,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-11 20:56:07,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 129 [2022-12-11 20:56:07,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 724 transitions, 16196 flow. Second operand has 7 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 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-11 20:56:07,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:56:07,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 129 [2022-12-11 20:56:07,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:56:09,971 INFO L130 PetriNetUnfolder]: 8634/20704 cut-off events. [2022-12-11 20:56:09,971 INFO L131 PetriNetUnfolder]: For 319482/347629 co-relation queries the response was YES. [2022-12-11 20:56:10,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129741 conditions, 20704 events. 8634/20704 cut-off events. For 319482/347629 co-relation queries the response was YES. Maximal size of possible extension queue 1560. Compared 242538 event pairs, 154 based on Foata normal form. 735/20963 useless extension candidates. Maximal degree in co-relation 129585. Up to 5216 conditions per place. [2022-12-11 20:56:10,072 INFO L137 encePairwiseOnDemand]: 123/129 looper letters, 342 selfloop transitions, 7 changer transitions 628/1191 dead transitions. [2022-12-11 20:56:10,072 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 1191 transitions, 31951 flow [2022-12-11 20:56:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 20:56:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 20:56:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 772 transitions. [2022-12-11 20:56:10,073 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8549280177187154 [2022-12-11 20:56:10,074 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 90 predicate places. [2022-12-11 20:56:10,074 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 1191 transitions, 31951 flow [2022-12-11 20:56:10,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 563 transitions, 12570 flow [2022-12-11 20:56:10,112 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 563 transitions, 12570 flow [2022-12-11 20:56:10,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 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-11 20:56:10,112 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:56:10,113 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1] [2022-12-11 20:56:10,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-11 20:56:10,113 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:56:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:56:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1535698564, now seen corresponding path program 2 times [2022-12-11 20:56:10,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:56:10,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324154649] [2022-12-11 20:56:10,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:56:10,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:56:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 20:56:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 20:56:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 20:56:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324154649] [2022-12-11 20:56:10,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324154649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 20:56:10,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 20:56:10,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-11 20:56:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036526745] [2022-12-11 20:56:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 20:56:10,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-11 20:56:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 20:56:10,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-11 20:56:10,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-11 20:56:10,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 129 [2022-12-11 20:56:10,563 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 563 transitions, 12570 flow. Second operand has 8 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 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-11 20:56:10,563 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 20:56:10,563 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 129 [2022-12-11 20:56:10,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 20:56:12,037 INFO L130 PetriNetUnfolder]: 4634/13018 cut-off events. [2022-12-11 20:56:12,038 INFO L131 PetriNetUnfolder]: For 162735/174966 co-relation queries the response was YES. [2022-12-11 20:56:12,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76125 conditions, 13018 events. 4634/13018 cut-off events. For 162735/174966 co-relation queries the response was YES. Maximal size of possible extension queue 1033. Compared 155857 event pairs, 116 based on Foata normal form. 1026/13864 useless extension candidates. Maximal degree in co-relation 75954. Up to 3263 conditions per place. [2022-12-11 20:56:12,084 INFO L137 encePairwiseOnDemand]: 113/129 looper letters, 58 selfloop transitions, 15 changer transitions 494/676 dead transitions. [2022-12-11 20:56:12,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 676 transitions, 16706 flow [2022-12-11 20:56:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 20:56:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 20:56:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 870 transitions. [2022-12-11 20:56:12,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7493540051679587 [2022-12-11 20:56:12,085 INFO L295 CegarLoopForPetriNet]: 136 programPoint places, 95 predicate places. [2022-12-11 20:56:12,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 676 transitions, 16706 flow [2022-12-11 20:56:12,099 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 182 transitions, 2560 flow [2022-12-11 20:56:12,100 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 182 transitions, 2560 flow [2022-12-11 20:56:12,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 94.25) internal successors, (754), 8 states have internal predecessors, (754), 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-11 20:56:12,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 20:56:12,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 1, 1] [2022-12-11 20:56:12,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-11 20:56:12,100 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-11 20:56:12,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 20:56:12,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2100243282, now seen corresponding path program 3 times [2022-12-11 20:56:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 20:56:12,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341837042] [2022-12-11 20:56:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 20:56:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 20:56:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:56:12,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-11 20:56:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-11 20:56:12,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-11 20:56:12,195 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-11 20:56:12,195 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-11 20:56:12,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-11 20:56:12,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-11 20:56:12,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-11 20:56:12,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-11 20:56:12,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-11 20:56:12,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-11 20:56:12,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-11 20:56:12,199 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 20:56:12,204 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 20:56:12,204 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 20:56:12,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 08:56:12 BasicIcfg [2022-12-11 20:56:12,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 20:56:12,335 INFO L158 Benchmark]: Toolchain (without parser) took 51921.14ms. Allocated memory was 218.1MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 192.3MB in the beginning and 2.7GB in the end (delta: -2.5GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-11 20:56:12,335 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory is still 195.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 20:56:12,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.30ms. Allocated memory is still 218.1MB. Free memory was 192.1MB in the beginning and 164.5MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-11 20:56:12,336 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.90ms. Allocated memory is still 218.1MB. Free memory was 164.5MB in the beginning and 161.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-11 20:56:12,336 INFO L158 Benchmark]: Boogie Preprocessor took 33.19ms. Allocated memory is still 218.1MB. Free memory was 161.9MB in the beginning and 159.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 20:56:12,336 INFO L158 Benchmark]: RCFGBuilder took 600.72ms. Allocated memory was 218.1MB in the beginning and 328.2MB in the end (delta: 110.1MB). Free memory was 159.8MB in the beginning and 285.4MB in the end (delta: -125.6MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. [2022-12-11 20:56:12,336 INFO L158 Benchmark]: TraceAbstraction took 50844.08ms. Allocated memory was 328.2MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 283.8MB in the beginning and 2.7GB in the end (delta: -2.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-11 20:56:12,337 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory is still 195.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 373.30ms. Allocated memory is still 218.1MB. Free memory was 192.1MB in the beginning and 164.5MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.90ms. Allocated memory is still 218.1MB. Free memory was 164.5MB in the beginning and 161.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.19ms. Allocated memory is still 218.1MB. Free memory was 161.9MB in the beginning and 159.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 600.72ms. Allocated memory was 218.1MB in the beginning and 328.2MB in the end (delta: 110.1MB). Free memory was 159.8MB in the beginning and 285.4MB in the end (delta: -125.6MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. * TraceAbstraction took 50844.08ms. Allocated memory was 328.2MB in the beginning and 4.8GB in the end (delta: 4.5GB). Free memory was 283.8MB in the beginning and 2.7GB in the end (delta: -2.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L725] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L726] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L727] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L728] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L729] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L730] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L731] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L732] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L733] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L734] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L735] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L736] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t577; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=-3, t577={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t578; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=-2, t577={5:0}, t578={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t579; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=-1, t577={5:0}, t578={6:0}, t579={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t580; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 847]: 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: 851]: 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: 849]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.9s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 50.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 42.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1471 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1471 mSDsluCounter, 1237 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 985 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2581 IncrementalHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 252 mSDtfsCounter, 2581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24624occurred in iteration=12, InterpolantAutomatonStates: 209, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 81806 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 1504 NumberOfCodeBlocks, 1504 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1388 ConstructedInterpolants, 0 QuantifiedInterpolants, 7464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-11 20:56:12,352 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...